Classification of bijections between 321- and 132-avoiding permutations

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 of 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 show how they are related to each other via "trivial" bijections. We classify the bijections according to statistics preserved (from a fixed, but large, set of statistics), obtaining substantial extensions of known results. Thus, we give a comprehensive survey and a systematic analysis of these bijections. 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 respects.

[1]  Rodica Simion,et al.  Restricted Permutations , 1985, Eur. J. Comb..

[2]  Sergi Elizalde,et al.  A Simple and Unusual Bijection for Dyck Paths and its Consequences , 2003 .

[3]  Donald E. Knuth.  The art of computer programming: fundamental algorithms , 1969 .

[4]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[5]  S. Kitaev,et al.  Stack sorting, trees, and pattern avoidance , 2008 .

[6]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[7]  Astrid Reifegerste.  A Generalization of Simion-Schmidt's Bijection for Restricted Permutations , 2002, Electron. J. Comb..

[8]  Igor Pak,et al.  Bijections for refined restricted permutations , 2004, J. Comb. Theory, Ser. A.

[9]  Richard P. Stanley,et al.  Some Combinatorial Properties of Schubert Polynomials , 1993 .

[10]  Kendra Killpatrick,et al.  An Area-to-Inv Bijection Between Dyck Paths and 312-avoiding Permutations , 2001, Electron. J. Comb..

[11]  Christian Krattenthaler,et al.  Permutations with Restricted Patterns and Dyck Paths , 2000, Adv. Appl. Math..

[12]  Rosena R. X. Du,et al.  Dyck paths and restricted permutations , 2006, Discret. Appl. Math..

[13]  Markus Fulmek.  Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three , 2003, Adv. Appl. Math..

[14]  J. Wrench.  Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth , 1970 .

[15]  Doron Rotem,et al.  On a Correspondence Between Binary Trees and a Certain Type of Permutation , 1975, Inf. Process. Lett..

[16]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[17]  Doron Zeilberger,et al.  A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!) , 1992, Discret. Math..

[18]  Julian West,et al.  Raney Paths and a Combinatorial Relationship between Rooted Nonseparable Planar Maps and Two-Stack-Sortable Permutations , 1996, J. Comb. Theory, Ser. A.

[19]  Doron Zeilberger,et al.  Refined Restricted Permutations , 2002, math/0203033.