Pattern avoidance in permutations: Linear and cyclic orders.
Vella, Antoine (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vella, Antoine (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Claesson, Anders, Kitaev, Sergey (2008)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Bóna, Miklós (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zara, Catalin (2003)
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:
Raykova, Mariana (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chebikin, Denis (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Albert, M.H., Atkinson, M.D., Brignall, R., Ruškuc, N., Smith, Rebecca, West, J. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Smith, Rebecca (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chen, William Y.C., Deng, Yu-Ping, Yang, Laura L.M. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chen, William Y.C., Liu, Lewis H. (2011)
The Electronic Journal of Combinatorics [electronic only]
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...