Restricted Dumont permutations, Dyck paths, and noncrossing partitions

We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding certain patterns of length 3 and 4 and give a natural bijection between 3142-avoiding Dumont permutations of the second kind and noncrossing partitions that uses cycle decomposition, as well as bijections between 132-, 231- and 321-avoiding Dumont permutations and Dyck paths. Finally, we enumerate Dumont permutations of the first kind simultaneously avoiding certain pairs of 4-letter patterns and another pattern of arbitrary length.

[1]  Julian West,et al.  Generating trees and forbidden subsequences , 1996, Discret. Math..

[2]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 2 , 1981 .

[3]  Zvezdelina Stankova,et al.  Forbidden subsequences , 1994, Discret. Math..

[4]  Mike D. Atkinson,et al.  Restricted permutations , 1999, Discret. Math..

[5]  Miklós Bóna.  Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps , 1997, J. Comb. Theory, Ser. A.

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

[7]  Toufik Mansour.  Restricted 132-Dumont permutations , 2004, Australas. J Comb..

[8]  Mikl Os,et al.  Exact Enumeration of 1342-avoiding Permutations a Close Link with Labeled Trees and Planar Maps , 1997 .

[9]  Zvezdelina Stankova.  Classification of Forbidden Subsequences of Length 4 , 1996, Eur. J. Comb..

[10]  Alexander Burstein,et al.  Restricted Dumont Permutations , 2004, math/0402378.

[11]  Julian West,et al.  Generating trees and the Catalan and Schröder numbers , 1995, Discret. Math..

[12]  Amitai Regev,et al.  Asymptotic values for degrees associated with strips of young diagrams , 1981 .

[13]  T. Mansour,et al.  Restricted permutations and Chebyshev polynomials. , 2002 .

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

[15]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[16]  Julian West,et al.  Permutations with forbidden subsequences, and, stack-sortable permutations , 1990 .

[17]  Ira M. Gessel,et al.  Symmetric functions and P-recursiveness , 1990, J. Comb. Theory, Ser. A.

[18]  Neil J. A. Sloane,et al.  The encyclopedia of integer sequences , 1995 .

[19]  Lauren K. Williams,et al.  Permutation tableaux and permutation patterns , 2007, J. Comb. Theory, Ser. A.

[20]  Miklós Bóna,et al.  Combinatorics of permutations , 2022, SIGA.

[21]  Dominique Dumont,et al.  Interprétations combinatoires des nombres de Genocchi , 1974 .

[22]  Astrid Reifegerste.  On the diagram of 132-avoiding permutations , 2003, Eur. J. Comb..