Number of cycles in the graph of $312$-avoiding permutations

Abstract : The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. However, instead of requiring the tail of one permutation to equal the head of another for them to be connected by an edge, we require that the head and tail in question have their letters appear in the same order of size. We give a formula for the number of cycles of length $d$ in the subgraph of overlapping $312$-avoiding permutations. Using this we also give a refinement of the enumeration of $312$-avoiding affine permutations.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [13 references]

https://hal.inria.fr/hal-01207587
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, October 1, 2015 - 9:28:53 AM
Last modification on : Wednesday, November 25, 2020 - 5:10:02 PM
Long-term archiving on: : Saturday, January 2, 2016 - 10:42:51 AM

File

dmAT0104.pdf
Publisher files allowed on an open archive

Identifiers

• HAL Id : hal-01207587, version 1

Citation

Richard Ehrenborg, Sergey Kitaev, Einar Steingrımsson. Number of cycles in the graph of $312$-avoiding permutations. 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), 2014, Chicago, United States. pp.37-48. ⟨hal-01207587⟩

Record views