References
- [1] R. M. Adin and Y. Roichman, Equidistribution and sign-balance on 321-avoiding permuta- tions, Sém. Lothar. Combin., 51 (2004) Article B51d.
- [2] E. Barcucci, A. Bernini, L. Ferrari and M. Poneti, A distributive lattice structure con- necting Dyck paths, noncrossing partitions and 312-avoiding permutations, Order, 22 (2005) 311-328.
- [3] E. Barcucci, A. Del Lungo, E. Pergola and R. Pinzani, ECO: a methodology for the Enumeration of Combinatorial Objects, J. Difference Equ. Appl., 5 (1999) 435-490.10.1080/10236199908808200
- [4] M. Bóna, Combinatorics of Permutations, Discrete Mathematics and Its Applications, Chapman and Hall/CRC, 2004.
- [5] A. Brini, Combinatorics, superalgebras, invariant theory and representation theory, Sém. Lothar. Combin., 55 (2007) Article B55g.
- [6] T. Brylawski, The lattice of integer partitions, Discrete Math., 6 (1973) 201-219.10.1016/0012-365X(73)90094-0
- [7] A. Claesson and S. Kitaev, Classiffcation of bijections between 321- and 132-avoiding per- mutations, Sém. Lothar. Combin., 60 (2008) Article B60d.10.46298/dmtcs.3594
- [8] S. Elizalde and I. Pak, Bijections for refined restricted permutations, J. Combin. Theory Ser. A, 105 (2004) 207-219.10.1016/j.jcta.2003.10.009
- [9] L. Ferrari and R. Pinzani, Lattices of lattice paths, J. Statist. Plann. Inference, 135 (2005) 77-92.10.1016/j.jspi.2005.02.007
- [10] W. Fulton, Young Tableaux, London Mathematical Society Student Text 35, Cambridge University Press, 1999.
- [11] D. E. Knuth, The Art of Computer Programming, Vol. I, Addison-Wesley, Reading, Mass.- London-DonMills, 1969.
- [12] D. E. Knuth, The Art of Computer Programming, vol. 3, Addison-Wesley, Reading, MA, 1973.
- [13] C. Krattenthaler, Permutations with restricted patterns and Dyck paths, Adv. in Appl. Math., 27 (2001) 510-530.
- [14] C. Schensted, Longest increasing and decreasing subsequences, Canad. J. Math, 13 (1961) 179-191.