Pattern avoidance classes and subpermutations

Electronic Journal of Combinatorics

Volumn 12, Issue 1 R, 2005, Pages

  Atkinson, M D ^a   Murphy, M M ^b   Ruskuc N ^b  

^a UNIVERSITY OF OTAGO   (New Zealand)

^b UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

Pattern avoidance; Restricted permutations; Subpermutations

Indexed keywords

EID: 27844438623     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1957     Document Type: Article

References (9)

1. M. H. Albert, M. D. Atkinson, N. Ruškuc: Regular Closed Classes of Permutations, Theoretical Computer Science 306 (2003), 85-100.
2. M. D. Atkinson: Restricted permutations, Discrete Math. 195 (1999), 27-38.
3. M. D. Atkinson, T. Stitt: Restricted permutations and the wreath product, Discrete Math. 259 (2002), 19-36.
4. M. D. Atkinson, M. M. Murphy, N. Ruškuc: Partially well ordered closed sets of permutations, Order 19 (2002), 101-113.
5. M. Bóna: The Solution of a Conjecture of Wilf and Stanley for all layered patterns, Journal of Combinatorial Theory, Series A 85 (1999), 96-104.
6. P. Cameron: "Combinatorics", Cambridge University Press, First Edition (1994).
7. M. M. Murphy: "Restricted Permutations, Antichains, Atomic Classes and Stack Sorting", Ph.D. Thesis, University of St Andrews, St Andrews, Scotland, UK (2002).
8. N. Ray, J. West: Posets of matrices and permutations with forbidden subsequences, Annals of Combinatorics 7 (2003), 55-88.
9. D. A. Spielman, M. Bóna: An infinite antichain of permutations, Electronic J. Combinat. 7 (2000), #N2.