Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice

DOI10.1016/0166-218X(91)90084-AzbMath0767.05009MaRDI QIDQ1182317

Takayuki Hibi

Publication date: 28 June 1992

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

zbMATH Keywords

inequalitiesfinite distributive latticenumber of chainscombinatorial sequence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial inequalities (05A20) Total orders (06A05) Distributive lattices (06D99)

Related Items

Hilbert functions of Cohen-Macaulay integral domains and chain conditions of finite partially ordered sets, Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff conference on ordered sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A multiindexed Sturm sequence of polynomials and unimodality of certain combinatorial sequences
• f-vectors and h-vectors of simplicial posets
• Flawless O-sequences and Hilbert functions of Cohen-Macaulay integral domains
• Two poset polytopes
• What can be said about pure O-sequences?
• 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
• Hilbert functions of graded algebras
• A lower bound theorem for Ehrhart polynomials of convex polytopes
• Canonical ideals of Cohen-Macaulay partially ordered sets
• The unimodality conjecture for convex polytopes
• Rings of Invariants of Tori, Cohen-Macaulay Rings Generated by Monomials, and Polytopes
• Ordered structures and partitions