论文信息 - Enumeration of graded (3+1)(3+1)-avoiding posets

Enumeration of graded (3+1)(3+1)-avoiding posets

Abstract The notion of ( 3 + 1 ) -avoidance has shown up in many places in enumerative combinatorics, but the natural goal of enumerating all ( 3 + 1 ) -avoiding posets remains open. In this paper, we enumerate graded ( 3 + 1 ) -avoiding posets for both reasonable definitions of the word “graded.” Our proof consists of a number of structural theorems followed by some generating function computations. We also provide asymptotics for the growth rate of the number of graded ( 3 + 1 ) -avoiding posets.

Joel Brewster Lewis | Yan X. Zhang

[1] Richard P. Stanley,et al. On Immanants of Jacobi-Trudi Matrices and Permutations with Restricted Position , 1993, J. Comb. Theory, Ser. A.

[2] Sukhada Fadnavis. A generalization of the Birthday problem and the chromatic polynomial , 2011, 1105.0698.

[3] P. Fishburn. Intransitive indifference with unequal indifference intervals , 1970 .

[4] ON THE GROUP-LIKE BEHAVIOR OF THE LE–MURAKAMI–OHTSUKI INVARIANT , 2005, math/0511452.

[5] Yan X. Zhang,et al. Enumeration of Graded (3 + 1)-Avoiding Posets (extended abstract) , 2012 .

[6] Sergey Kitaev,et al. (2+2)-free Posets, Ascent Sequences and Pattern Avoiding Permutations , 2008, J. Comb. Theory, Ser. A.

[7] R. Stanley. What Is Enumerative Combinatorics , 1986 .

[8] Mark Skandera. A Characterization of (3+1)-Free Posets , 2001, J. Comb. Theory, Ser. A.

[9] Da David Klarner,et al. The number of graded partially ordered sets , 1969 .

[10] Mathieu Guay-Paquet,et al. Structure and Enumeration of (3+1)-Free Posets , 2012 .

[11] Bruce E. Sagan,et al. Counting s(3+1)-avoiding permutations , 2012, Eur. J. Comb..

[12] E. Bender. An asymptotic expansion for the coefficients of some formal power series , 1975 .

[13] A. Odlyzko. Asymptotic enumeration methods , 1996 .

[14] R. Stanley. Enumerative Combinatorics: Volume 1 , 2011 .

[15] Ira M. Gessel. Review: Ian P. Goulden and David M. Jackson, Combinatorial enumeration , 1985 .