Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff Conference on Ordered Sets

Advances in Applied Mathematics

Volumn 34, Issue 2, 2005, Pages 295-312

  Farley, Jonathan David ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

(Partially) Ordered set; Descent; Eulerian numbers; h vector; Linear extension; Natural labelling; P partition

Indexed keywords

COMBINATORIAL MATHEMATICS; POLYNOMIALS; THEOREM PROVING; VECTORS;

DESCENT; EULERIAN NUMBERS; LINEAR EXTENSION; NATURAL LABELLING; ORDERED SET;

SET THEORY;

EID: 11244309390     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aam.2004.05.007     Document Type: Article

References (23)

1. W. Bruns J. Herzog Cohen-Macaulay Rings 1993 Cambridge University Press Cambridge
2. B.A. Davey H.A. Priestley Introduction to Lattices and Order second ed. 2002 Cambridge University Press Cambridge
3. J.D. Farley, A. Myers, # seq's w. d descents = # seq's w. d + r - 1 ascents, 2001, manuscript
4. A.M. Garsia S.C. Milne Method for constructing bijections for classical partition identities Proc. Natl. Acad. Sci. USA 78 1981 2026-2028
5. V. Gasharov On the Neggers-Stanley conjecture and the Eulerian polynomials J. Combin. Theory (A) 82 1998 134-146
6. T. Hibi What can be said about pure O-sequences? J. Combin. Theory (A) 50 1989 319-322
7. T. Hibi Hilbert functions of Cohen-Macaulay integral domains and chain conditions of finite partially ordered sets J. Pure Appl. Algebra 72 1991 265-273
8. T. Hibi Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice Discrete Appl. Math. 34 1991 145-150
9. D.E. Knuth The Art of Computer Programming, vol 3: Sorting and Searching 1973 Addison-Wesley Publishing Company Reading, MA
10. G. Kreweras Polynomes de Stanley et extensions linéaires d'un ordre partiel Math Sci. Hum. 73 1981 97-116
11. P.A. MacMahon Combinatory Analysis, vol. I 1915 Cambridge University Press Cambridge
12. V. Reiner, V. Welker, On the Charney-Davis and Neggers-Stanley conjectures, 2003, preprint
13. I. Rival (Ed.) Ordered Sets: Proceedings of the NATO Advanced Study Institute, Banff, Canada, August 28 to September 12, 1981 1982 Reidel Publishing Company Dordrecht, The Netherlands
14. B.E. Sagan The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions second ed. 2001 Springer-Verlag New York
15. M. Skandera Dumont's statistic on words Electron. J. Combin. 8 2001 19 # R11
16. R.P. Stanley Ordered Structures and Partitions Mem. Amer. Math. Soc. vol. 119 1972 American Mathematical Society Providence, RI
17. R.P. Stanley Combinatorial reciprocity theorems Adv. Math. 14 1974 194-253
18. R.P. Stanley The number of faces of a simplicial convex polytope Adv. Math. 35 1980 236-238
19. R.P. Stanley On the Hilbert function of a graded Cohen-Macaulay domain J. Pure Appl. Algebra 73 1991 307-314
20. R.P. Stanley Enumerative Combinatorics, vol. I corrected reprint 1997 Cambridge University Press Cambridge
21. D. Stanton D. White Constructive Combinatorics 1986 Springer-Verlag New York
22. D. Zeilberger André's reflection proof generalized to the many-candidate ballot problem Discrete Math. 44 1983 325-326
23. G.M. Ziegler Lectures on Polytopes, corrected reprint 1998 Springer-Verlag New York