Permutation reconstruction.
Smith, Rebecca (2006)
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.
Displaying similar documents to “Permutations which are the union of an increasing and a decreasing subsequence.”
Permutation reconstruction.
Permutation reconstruction from minors.
Raykova, Mariana (2006)
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:
Permutation separations and complete bipartite factorisations of .
Martin, Nigel, Stong, Richard (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Counting occurrences of 132 in an even permutation.
Mansour, Toufik (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Pattern avoidance classes and subpermutations.
Atkinson, M.D., Murphy, M.M., Ruškuc, N. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alternating, pattern-avoiding permutations.
Lewis, Joel Brewster (2009)
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:
Parity-alternating permutations and successions
Augustine Munagi (2014)
Open Mathematics
Similarity:
The study of parity-alternating permutations of {1, 2, … n} is extended to permutations containing a prescribed number of parity successions - adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using direct construction and elementary combinatorial techniques. Analogous results are derived for circular...
Enumeration schemes for permutations avoiding barred patterns.
Pudwell, Lara (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: