EUVIMEDEUVIMED entdecken
Crossref

Classification of bijections between 321- and 132-avoiding permutations

Anders Claesson, Sergey Kitaev

Discrete Mathematics & Theoretical Computer Science · 01.01.2008 · DMTCS Proceedings vol. AJ,... (Proceedings)

DOI: 10.46298/dmtcs.3594 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, online erschienen am 01.01.2008. Verfasst von Anders Claesson und 1 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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).

Zitieren

APA

Claesson, A., & Kitaev, S. (2008). Classification of bijections between 321- and 132-avoiding permutations. Discrete Mathematics & Theoretical Computer Science, DMTCS Proceedings vol. AJ,...(Proceedings). https://doi.org/10.46298/dmtcs.3594

Vancouver

Claesson A, Kitaev S. Classification of bijections between 321- and 132-avoiding permutations. Discrete Mathematics & Theoretical Computer Science. 2008;DMTCS Proceedings vol. AJ,...(Proceedings). doi:10.46298/dmtcs.3594

BibTeX
@article{Claesson2008,
  author = {Claesson, Anders and Kitaev, Sergey},
  title = {Classification of bijections between 321- and 132-avoiding permutations},
  journal = {Discrete Mathematics & Theoretical Computer Science},
  year = {2008},
  volume = {DMTCS Proceedings vol. AJ,...},
  number = {Proceedings},
  doi = {10.46298/dmtcs.3594}
}
Kostenlos starten →