Skip to Main content Skip to Navigation

# Universal cycles for permutation classes

Abstract : We define a universal cycle for a class of $n$-permutations as a cyclic word in which each element of the class occurs exactly once as an $n$-factor. We give a general result for cyclically closed classes, and then survey the situation when the class is defined as the avoidance class of a set of permutations of length $3$, or of a set of permutations of mixed lengths $3$ and $4$.
Keywords :
Document type :
Conference papers
Domain :
Complete list of metadata

Cited literature [7 references]

https://hal.inria.fr/hal-01185419
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 20, 2015 - 11:08:48 AM
Last modification on : Tuesday, August 13, 2019 - 3:36:49 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:53:55 AM

### File

dmAK0104.pdf
Publisher files allowed on an open archive

### Citation

Michael Albert, Julian West. Universal cycles for permutation classes. 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. pp.39-50, ⟨10.46298/dmtcs.2727⟩. ⟨hal-01185419⟩

Record views

Files downloads