Enumeration schemes for permutations avoiding barred patterns.
Pudwell, Lara (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Alternating, pattern-avoiding permutations.”
Enumeration schemes for permutations avoiding barred patterns.
Permutations avoiding two patterns of length three.
Vatter, Vincent R. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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:
Variations on descents and inversions in permutations.
Chebikin, Denis (2008)
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:
The permutation classes equinumerous to the smooth class.
Bóna, Miklós (1998)
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:
A survey of stack-sorting disciplines.
Bóna, Miklós (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:
Three-letter-pattern avoiding permutations and functional equations.
Firro, Ghassan, Mansour, Toufik (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permutation reconstruction.
Smith, Rebecca (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Similar permutations in the alternating group
J. Denés, K. Schermann (1968)
Matematički Vesnik
Similarity: