ARSCOM
2005
13 years 4 months ago
2005
In [BabStein] Babson and Steingr
EJC
2007
13 years 4 months ago
2007
We present various techniques to count proportions of permutations with restricted cycle structure in finite permutation groups. For example, we show how a generalized block theo...
DM
2007
13 years 4 months ago
2007
We consider the problem of determining the maximum number of moves required to sort a permutation of [n] using cut-and-paste operations, in which a segment is cut out and then pas...
JCT
2008
13 years 4 months ago
2008
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
JCT
2008
13 years 4 months ago
2008
Given sets X and Y of positive integers and a permutation = 12
CORR
2007
Springer
13 years 4 months ago
2007
Springer
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
COMBINATORICS
2007
13 years 4 months ago
2007
For a permutation π = π1π2 · · · πn ∈ Sn and a positive integer i ≤ n, we can view π1π2 · · · πi as an element of Si by order-preserving relabeling. The j-set of ...
COMBINATORICS
2007
13 years 4 months ago
2007
We determine the limiting distributions of the longest alternating subsequence for pattern-restricted permutations in which the pattern is any one of the six patterns of length th...
IJES
2008
13 years 4 months ago
2008
Block ciphers are used to encrypt data and provide data confidentiality. For interoperability reasons, it is desirable to support a variety of block ciphers efficiently. Of the bas...
EJC
2006
13 years 4 months ago
2006
The digraphs P(n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, K...