An upper bound theorem for rational polytopes
From MaRDI portal
Publication:1268610
DOI10.1006/jcta.1997.2849zbMath0917.52009OpenAlexW2021783993MaRDI QIDQ1268610
Publication date: 21 July 1999
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9c0748432bb212bef66be5204d1dc9686767c2d5
toric varietiesupper bound theorem\(h\)-vectors\(f\)-vectorsalgebraic combinatorics of convex polytopes
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Commutative algebra and combinatorics. (Papers based on lectures delivered at the US-Japan Joint Seminar on Commutative Algebra and Combinatorics, held in Kyoto, Japan, August 25-31, 1985)
- Intersection homology of toric varieties and a conjecture of Kalai
- The number of faces of a simplicial convex polytope
- Equidecomposable and weakly neighborly polytopes
- Twisted incidence algebras and Kazhdan-Lusztig-Stanley functions
- The Rational Homology of Toric Varieties is Not a Combinatorial Invariant
- Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopes
- Subdivisions and Local h-Vectors
- The toric ℎ-vectors of partially ordered sets
- Lawrence Polytopes
- The maximum numbers of faces of a convex polytope