Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff conference on ordered sets
type: Item
instance of: scholarly article
title: Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff conference on ordered sets
zbMATH Open document ID: 1068.06003
author: Jonathan David Farley
published in: Advances in Applied Mathematics
publication date: 2005-05-04T00:00:00Z
review text: In reviewing this paper, where the author solves a problem of Richard P. Stanley he himself might have solved based on his own work as noted by the author, one gets the sense that the write-up and the solution contains a meta-combinatorial component in its somewhat unusual but praiseworthy presentation which includes such ``wasted space'' as a very detailed worked-out example involving ideas presented in the proof of the main result as well as a short compendium of some smaller posets and their \(h\)-vectors for the student to savor. The question addressed successfully is to find a truly combinatorial proof of Stanley's generalization of Mac Mahon's theorem; i.e., to show that when \(P\) is a (finite) ranked poset, then \(h_k= h_{M-k}\), where \(M= \max\{d(\pi)\mid\pi\in L(p)\}\), \(L(P)\) is the set of linear extensions of \(P\), \(d(\pi)\) is the number of descents of the element \(\pi\in P\), and \(h_k= |H_k|\), with \(H_k\) the set of linear extensions (permutations compatible with the order on \(P\)) with \(k\) descents. After doing so, the author proposes it is possible to do better still in providing the most purely combinatorial argument in an optimally natural form. Thus does the world turn.
reviewed by: J. Neggers
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 05A99
Mathematics Subject Classification ID: 06A05
zbMATH DE Number: 2164941
zbMATH Keywords: Partially ordered set
zbMATH Keywords: Linear extension
zbMATH Keywords: Natural labelling
zbMATH Keywords: Descent
zbMATH Keywords: \(h\)-vector
zbMATH Keywords: \(P\)-partition
zbMATH Keywords: Eulerian numbers
zbMATH Keywords: finite poset
zbMATH Keywords: permutations
zbMATH Keywords: ranked poset
MaRDI profile type: Publication
full work available at URL: j.aam.2004.05.007
OpenAlex ID: W2169235006
cites work: Q4274969
cites work: Q4530231
cites work: Method for constructing bijections for classical partition identities
cites work: On the Neggers-Stanley conjecture and the Eulerian polynomials
cites work: What can be said about pure O-sequences?
cites work: Hilbert functions of Cohen-Macaulay integral domains and chain conditions of finite partially ordered sets
cites work: Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice
cites work: Q4057549
cites work: Q3910571
cites work: On the Charney-Davis and Neggers-Stanley conjectures
cites work: Q2716065
cites work: Dumont's statistic on words
cites work: Ordered structures and partitions
cites work: Combinatorial reciprocity theorems
cites work: The number of faces of a simplicial convex polytope
cites work: On the Hilbert function of a graded Cohen-Macaulay domain
cites work: Q4344108
cites work: Q3726126
cites work: Andre's reflection proof generalized to the many-candidate ballot problem
DOI: 10.1016/J.AAM.2004.05.007
description: scientific article; zbMATH DE number 2164941