Linear inequalities for flags in graded partially ordered sets

DOI10.1006/jcta.1999.3008zbMath0959.52010OpenAlexW2020369970MaRDI QIDQ1971014

Billera, Louis J., Gábor Hetyei

Publication date: 28 November 2000

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1999.3008

zbMATH Keywords

convolutiongraded posetsprojectionantichainflagchainlinear inequalitiesfacetblockerflag \(f\)-vectorchain operatorgraded partially ordered set

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorics of partially ordered sets (06A07)

Related Items

Discrete Morse functions from lexicographic orders ⋮ Level Eulerian posets. ⋮ Peak quasisymmetric functions and Eulerian enumeration ⋮ On the flag \(f\)-vector of a graded lattice with nontrivial homology ⋮ The poset of bipartitions ⋮ Signs in the 𝑐𝑑-index of Eulerian partially ordered sets ⋮ Linear inequalities for enumerating chains in partially ordered sets ⋮ Noncommutative enumeration in graded posets ⋮ A characterization of \((3+1)\)-free posets ⋮ Flag vectors of Eulerian partially ordered sets ⋮ Coloring complexes and combinatorial Hopf monoids

Cites Work

• A new basis of polytopes
• Geometric algorithms and combinatorial optimization
• Decompositions of partially ordered sets
• Combinatorics and commutative algebra.
• On Subsemigroups of Free Semigroups
• Bottleneck extrema
• Noncommutative enumeration in graded posets