By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...

December 23, 2009 Version 1.1-0 Date 2009-12-22 Depends R (>= 2.10.1), mvtnorm Title Modified Maximum Contrast Method Author Kengo NAGASHIMA and Yasunori SATO Maintainer Kengo NAGASHIMA Description This package provides an implementation of a modified maximum contrast method and the maximum contrast method. This version supports functions mmcm.mvt, mcm.mvt that gives P-va...

We develop the technique of reduced word manipulation to give a range of results concerning reduced words and permutations more generally. We prove a broad connection between pattern containment and reduced words, which specializes to our previous work for vexillary permutations. We also analyze general tilings of Elnitsky’s polygon, and demonstrate that these are closely related to the pattern...

In what follows this assertion will be called the identifiability thesis since it states that two arbitrary but different courses-of-values can be identified with the truthvalues. Frege considers the identifiability thesis a consequence of his previous argumentation ([3], p. 17, lines 23-36) which, following Dummett ([1], p. 408), will be called the permutation argument, because the concept of ...

this paper presents a new audio encryption algorithm based on permutation and residue number system. in the current approach, signal samples are combined with residue number system through permutation; therefore, a specific noise is generated. then, the audio signal is combined with the noise, generated by the algorithm, to produce a silence signal. for this purpose, the algorithm uses a predef...

A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.

The first polynomial time algorithm (O(n)) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear-time algorithms [22, 7, 23, 9]. Although having optimal time complexity these algorithms are quite complicated and difficult to implement. In this paper we present an easily implementable linear-time algorithm for modul...

Let A2(n, d) be the maximum size of a binary code of length n and minimum distance d. In this paper we present the following new lower bounds: A2(18, 4) ≥ 5632, A2(21, 4) ≥ 40960, A2(22, 4) ≥ 81920, A2(23, 4) ≥ 163840, A2(24, 4) ≥ 327680, A2(24, 10) ≥ 136, and A2(25, 6) ≥ 17920. The new lower bounds are a result of a systematic computer search over transitive permutation groups.