Pattern avoidance classes and subpermutations.
Atkinson, M.D., Murphy, M.M., Ruškuc, N. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Sorting classes.”
Pattern avoidance classes and subpermutations.
Permutation reconstruction from minors.
Raykova, Mariana (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permutation reconstruction.
Smith, Rebecca (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The insertion encoding of permutations.
Albert, Michael H., Linton, Steve, Ruskuc, Nik (2005)
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:
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:
Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph.
Zara, Catalin (2003)
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:
Counting occurrences of 132 in an even permutation.
Mansour, Toufik (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A survey of stack-sorting disciplines.
Bóna, Miklós (2003)
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:
Permutation separations and complete bipartite factorisations of .
Martin, Nigel, Stong, Richard (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity: