Affiliation:
1. LE2I , Université de Bourgogne , B.P. 47 870, 21078 Dijon , France
Abstract
Abstract
We investigate an equivalence relation on permutations based on the pure descent statistic. Generating functions are given for the number of equivalence classes for the set of all permutations, and the sets of permutations avoiding exactly one pattern of length three. As a byproduct, we exhibit a permutation set in one-to-one correspondence with forests of ordered binary trees, which provides a new combinatorial class enumerated by the single-source directed animals on the square lattice. Furthermore, bivariate generating functions for these sets are given according to various statistics.
Reference22 articles.
1. [1] E. Babson and E. Steingrímsson, Generalized permutation patterns and a classification of Mahonian statistics, Sém. Lothar. Combin., 44 (2000) Article B44b.
2. [2] E. Barcucci, A. Del Lungo, E. Pergola and R. Pinzani, Directed animals, forests and permutations, Discrete Math., 204 (1999) 41–71.10.1016/S0012-365X(98)00366-5
3. [3] J.-L. Baril, T. Mansour and A. Petrossian, Equivalence classes of permutations modulo excedances, J. Comb., 5 (2014) 453–469.10.4310/JOC.2014.v5.n4.a4
4. [4] J.-L. Baril and A. Petrossian, Equivalence classes of permutations modulo descents and left-to-right maxima, Pure Math. Appl. (PU.M.A.), 25 (2015) 19–29.10.1515/puma-2015-0002
5. [5] J.-L. Baril and S. Kirgizov, The pure descent statistics on permutations, Discrete Math., 340 (2017) 2550–2558.10.1016/j.disc.2017.06.005