More bijective Catalan combinatorics on permutations and on signed permutations

P.A. MacMahon, Combinatory analysis Vol. 2 , Cambridge University Press, London, 1960

1960

Earlier work this paper cites.

D.E. Knuth, The art of computer programming Vol. 1 , Addison-Wesley, Reading, Mass. (1973)

1973

Earlier work this paper cites.

J. Fürlinger and J. Hofbauer, q q -Catalan numbers , J. Combin. Theory Ser. A 40

1985

Earlier work this paper cites.

G.E. Andrews, The theory of partitions , Encyclopedia of Mathȧnd its Applications, vol. 2, Addison–Wesley, Reading, 1976, reprinted by Cambridge University Press, Cambridge, 1998

1998

Earlier work this paper cites.

R.M. Adin, F. Brenti, and Y. Roichman, Descent numbers and major indices for the hyperoctahedral group , Adv. in Appl. Math. 27

2001

Earlier work this paper cites.

J. Bandlow and K. Killpatrick, An area-to-inv bijection between Dyck paths and 312 312 -avoiding permutations , J. Algebraic Combin. 8

2001

Cited alongside, same era.

C. Krattenthaler, Permutations with restricted patterns and Dyck paths , Adv. in Appl. Math. 27

2001

Cited alongside, same era.

A. Reifegerste, On the diagram of 132 132 -avoiding permutations , European J. Combin. 24

2003

Cited alongside, same era.

D. Armstrong, Generalized noncrossing partitions and combinatorics of Coxeter groups , Mem. Amer. Math. Soc. 202

2006

Cited alongside, same era.

D. Callan, Bijections from Dyck paths to 321 321 -avoiding permutations revisited , preprint, available at arxiv.org/abs/0711.2684v1 (2007)

Original

2007

Later among the works it cites.

N. Reading, Sortable elements and Cambrian lattices , Algebra Universalis 56

2007

Later among the works it cites.

C. Stump, On bijections between 231 231 -avoiding permutations and Dyck paths , Sém. Lothar. Combin. 60

2009

Closest in time.

M. Rubey and C. Stump, Crossings and nestings in set partitions of classical types , Electron. J. Combin. 17

2010

Closest in time.