Hard Lefschetz theorem for simple polytopes
From MaRDI portal
Publication:610452
DOI10.1007/s10801-009-0212-1zbMath1210.52005OpenAlexW2115663040MaRDI QIDQ610452
Publication date: 8 December 2010
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-009-0212-1
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Toric varieties, Newton polyhedra, Okounkov bodies (14M25)
Related Items (5)
Lagrangian geometry of matroids ⋮ Hodge theory in combinatorics ⋮ Face numbers: the upper bound side of the story ⋮ Lefschetz properties in algebra, geometry and combinatorics. Abstracts from the workshop held September 27 -- October 3, 2020 (hybrid meeting) ⋮ FAQ on the g-theorem and the hard Lefschetz theorem for face rings
Cites Work
- Unnamed Item
- The number of faces of a simplicial convex polytope
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- On simple polytopes
- The structure of the polytope algebra
- Combinatorial intersection cohomology for fans.
- Weights on polytopes
- The numbers of faces of simplicial polytopes
- Introduction to Toric Varieties. (AM-131)
- An analogue of the Hodge-Riemann relations for simple convex polytopes
This page was built for publication: Hard Lefschetz theorem for simple polytopes