References
- [1] E. B
abson and E. Steingrímsson , Generalized permutation patterns and a classification of Mahonian statistics, Sém. Lothar. Combin., 44 (2000) Article B44b. - [2] E. B
arcucci , A. Del Lungo , E. Pergola and R. Pinzani , Directed animals, forests and permutations, Discrete Math., 204 (1999) 41–71. - [3] J.-L. B
aril , T. Mansour and A. Petrossian , Equivalence classes of permutations modulo excedances, J. Comb., 5 (2014) 453–469. - [4] J.-L. B
aril and A. Petrossian , Equivalence classes of permutations modulo descents and left-to-right maxima, Pure Math. Appl. (PU.M.A.), 25 (2015) 19–29. - [5] J.-L. B
aril and S. Kirgizov , The pure descent statistics on permutations, Discrete Math., 340 (2017) 2550–2558. - [6] F. B
ergeron , N. Bergeron , R. B. Howlett and D. E. Taylor , A decomposition of the descent algebra of a finite Coxeter group, J. Algebraic Combin., 1 (1992) 23–44. - [7] M. B
óna , Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps, J. Combin. Theory Ser. A, 80 (1997) 257–272. - [8] M. B
óna , Combinatorics of permutations, Chapman and Hall/CRC, Second Edition, 2012. - [9] M. B
ousquet -Mélou , New enumerative results on two-dimensional directed animals, Proc. 7th FPSAC, Université de Marne-la-Vallée, Paris, 1995, 103–116. - [10] M. B
ousquet -Mélou and S. Butler , Forest-like permutations, Ann. Comb., 11 (2007) 335–354. - [11] I. G
essel and G. Viennot , Binomial determinants, paths, and hook length formulae, Adv. Math., 58 (1985) 300–321. - [12] I. G
essel , Symmetric functions and P-recursiveness, J. Combin. Theory Ser. A, 53 (1990) 257–285. - [13] S. K
itaev , Patterns in permutations and words, Springer-Verlag, 2011. - [14] D. E. K
nuth , The art of computer programming - Vol. 1, Addison-Wesley, Reading MA, 1973, Third edition, 1997. - [15] P. A. M
ac Mahon , Combinatory Analysis. Vols. 1 and 2, Cambridge Univ. Press, Cambridge, UK, 1915 (reprinted by Chelsea, New-York, 1955). - [16] T. M
ansour , Combinatorics of Set Partitions, Chapman & Hall/CRC, 2013. - [17] L. P
udwell , Enumeration schemes for permutations avoiding barred patterns, Electron. J. Combin., 17 (2010) #R29. - [18] R. S
imion and F. W. Schmidt , Restricted permutations, European J. Combin., 6 (1985) 383–406. - [19] N. J. A. S
loane , On-Line Encyclopedia of Integer Sequences, Published electronically at http://oeis.org/. - [20] R. P. S
tanley , Enumerative Combinatorics - Vol. 1, Cambridge University Press, 1997. - [21] J. W
est , Permutations with forbidden subsequences and stack-sortable permutations, Ph.D. Thesis, MIT, 1990. - [22] R. M. W
ilson and J. H. Lint , A course in combinatorics - Vol. I, Cambridge University Press, 2002.