Permutations containing and avoiding 123 and 132 patterns.
Robertson, Aaron (1999)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Robertson, Aaron (1999)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Mansour, Toufik, Vainshtein, Alek (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Smith, Rebecca (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Raykova, Mariana (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Marian Rejewski (1980)
Applicationes Mathematicae
Similarity:
Bóna, Miklós (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Barcucci, Elena, Del Lungo, Alberto, Pergola, Elisa, Pinzani, Renzo (2000)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Mansour, Toufik (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
J. Denés, K. Schermann (1968)
Matematički Vesnik
Similarity:
Atkinson, M.D., Murphy, M.M., Ruškuc, N. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...
Lewis, Joel Brewster (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: