Sorting classes.
Albert, M.H., Aldred, R.E.L., Atkinson, M.D., Handley, C.C., Holton, D.A., McCaughan, D.J., van Ditmarsch, H. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Pattern avoidance classes and subpermutations.”
Sorting classes.
Permutation reconstruction from minors.
Raykova, Mariana (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph.
Zara, Catalin (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permutation reconstruction.
Smith, Rebecca (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Growth rates for subclasses of Av(321).
Albert, M.H., Atkinson, M.D., Brignall, R., Ruškuc, N., Smith, Rebecca, West, J. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The permutation classes equinumerous to the smooth class.
Bóna, Miklós (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An application of the theory of permutations in breaking the Enigma cipher
Marian Rejewski (1980)
Applicationes Mathematicae
Similarity:
An answer to a question by Wilf on packing distinct patterns in a permutation.
Coleman, Micah (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permutations containing and avoiding 123 and 132 patterns.
Robertson, Aaron (1999)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Permutation separations and complete bipartite factorisations of .
Martin, Nigel, Stong, Richard (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On packing densities of permutations.
Albert, M.H., Atkinson, M.D., Handley, C.C., Holton, D.A., Stromquist, W. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axial permutations of ω²
Paweł Klinga (2016)
Colloquium Mathematicae
Similarity:
We prove that every permutation of ω² is a composition of a finite number of axial permutations, where each axial permutation moves only a finite number of elements on each axis.
Permutations avoiding an increasing number of length-increasing forbidden subsequences.
Barcucci, Elena, Del Lungo, Alberto, Pergola, Elisa, Pinzani, Renzo (2000)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity: