Results 1 to 10 of about 404,254 (120)

Permutation Classes of Polynomial Growth [PDF]

open access: yes, 2007
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations.
M. D. Atkinson   +5 more
core   +4 more sources

Continued fractions for permutation statistics

open access: yes, 2018
We explore a bijection between permutations and colored Motzkin paths that has been used in different forms by Foata and Zeilberger, Biane, and Corteel.
Elizalde, Sergi
core   +1 more source

Systematic Codes for Rank Modulation [PDF]

open access: yes, 2014
The goal of this paper is to construct systematic error-correcting codes for permutations and multi-permutations in the Kendall's $\tau$-metric. These codes are important in new applications such as rank modulation for flash memories. The construction is
Bruck, Jehoshua   +3 more
core   +2 more sources

On k-crossings and k-nestings of permutations [PDF]

open access: yes, 2009
We introduce k-crossings and k-nestings of permutations. We show that the crossing number and the nesting number of permutations have a symmetric joint distribution.
Burrill, Sophie   +2 more
core   +1 more source

On the sub-permutations of pattern avoiding permutations

open access: yes, 2014
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees.
Disanto, Filippo, Wiehe, Thomas
core   +1 more source

Alternating, pattern-avoiding permutations [PDF]

open access: yes, 2008
We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set S_n(132) of 132-avoiding permutations and the set A_{2n + 1}(132) of alternating, 132-avoiding ...
Lewis, Joel Brewster
core   +1 more source

Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays

open access: yes, 2016
A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal overlapping patterns in
Pan, Ran, Remmel, Jeffrey B.
core   +1 more source

On the Decoding of Polar Codes on Permuted Factor Graphs

open access: yes, 2018
Polar codes are a channel coding scheme for the next generation of wireless communications standard (5G). The belief propagation (BP) decoder allows for parallel decoding of polar codes, making it suitable for high throughput applications.
Doan, Nghia   +3 more
core   +1 more source

The enumeration of permutations avoiding 2143 and 4231 [PDF]

open access: yes, 2011
We enumerate the pattern class Av(2143, 4231) and completely describe its permutations.
Albert, M. H.   +2 more
core   +2 more sources

Uniquely-Wilf classes

open access: yes, 2019
Two permutations in a class are Wilf-equivalent if, for every size, $n$, the number of permutations in the class of size $n$ containing each of them is the same.
Albert, Michael, Li, Jinge
core   +1 more source

Home - About - Disclaimer - Privacy