Linear inequalities for flags in graded partially ordered sets
DOI10.1006/JCTA.1999.3008zbMATH Open0959.52010OpenAlexW2020369970MaRDI QIDQ1971014FDOQ1971014
Authors: Billera, Louis J., Gabor 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
Recommendations
convolutionprojectiongraded posetsblockerfacetlinear inequalitiesantichainchainflagflag \(f\)-vectorchain operatorgraded partially ordered set
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)
Cites Work
Cited In (15)
- Flag vectors of Eulerian partially ordered sets
- A characterization of \((3+1)\)-free posets
- The poset of bipartitions
- Linear inequalities for enumerating chains in partially ordered sets
- Coloring complexes and combinatorial Hopf monoids
- On the posets \((\mathcal W_2^k,<)\) and their connections with some homogeneous inequalities of degree 2
- Discrete Morse functions from lexicographic orders
- On the flag \(f\)-vector of a graded lattice with nontrivial homology
- Level Eulerian posets.
- Peak quasisymmetric functions and Eulerian enumeration
- Signs in the \(cd\)-index of Eulerian partially ordered sets
- Noncommutative enumeration in graded posets
- Linear extensions and order polynomials of finite partially ordered sets
- Generalizations of Eulerian partially ordered sets, flag numbers, and the Möbius function
- Decompositions of partially ordered sets
This page was built for publication: Linear inequalities for flags in graded partially ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971014)
