Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff conference on ordered sets

DOI10.1016/j.aam.2004.05.007zbMath1068.06003MaRDI QIDQ1775739

Jonathan David Farley

Publication date: 4 May 2005

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2004.05.007

zbMATH Keywords

permutations; \(h\)-vector; finite poset; ranked poset; Eulerian numbers; \(P\)-partition; Partially ordered set; Descent; Linear extension; Natural labelling

Mathematics Subject Classification ID

06A07: Combinatorics of partially ordered sets

05A99: Enumerative combinatorics

06A05: Total orders

Related Items

Unnamed Item, On the enumeration of certain weighted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• What can be said about pure O-sequences?
• The number of faces of a simplicial convex polytope
• Hilbert functions of Cohen-Macaulay integral domains and chain conditions of finite partially ordered sets
• On the Hilbert function of a graded Cohen-Macaulay domain
• Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice
• On the Neggers-Stanley conjecture and the Eulerian polynomials
• Dumont's statistic on words
• On the Charney-Davis and Neggers-Stanley conjectures
• Andre's reflection proof generalized to the many-candidate ballot problem
• Method for constructing bijections for classical partition identities
• Ordered structures and partitions
• Combinatorial reciprocity theorems