# Classification of bijections between 321- and 132-avoiding permutations

Abstract : It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permutations is equal to that of 132-avoiding permutations. In the literature one can find many subsequent bijective proofs confirming this fact. It turns out that some of the published bijections can easily be obtained from others. In this paper we describe all bijections we were able to find in the literature and we show how they are related to each other (via "trivial'' bijections). Thus, we give a comprehensive survey and a systematic analysis of these bijections. We also analyze how many permutation statistics (from a fixed, but large, set of statistics) each of the known bijections preserves, obtaining substantial extensions of known results. We also give a recursive description of the algorithmic bijection given by Richards in 1988 (combined with a bijection by Knuth from 1969). This bijection is equivalent to the celebrated bijection of Simion and Schmidt (1985), as well as to the bijection given by Krattenthaler in 2001, and it respects 11 statistics (the largest number of statistics any of the bijections respect).
Keywords :
Document type :
Conference papers
Domain :

Cited literature [16 references]

https://hal.inria.fr/hal-01185127
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 19, 2015 - 11:39:58 AM
Last modification on : Monday, August 24, 2020 - 3:42:06 PM
Long-term archiving on: : Friday, November 20, 2015 - 10:24:31 AM

### File

dmAJ0143.pdf
Publisher files allowed on an open archive

### Citation

Anders Claesson, Sergey Kitaev. Classification of bijections between 321- and 132-avoiding permutations. 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), 2008, Viña del Mar, Chile. pp.495-506, ⟨10.46298/dmtcs.3594⟩. ⟨hal-01185127⟩

Record views