Hard Lefschetz theorem for simple polytopes
This paper contains a new original proof of the Hard Lefschetz theorem for simple polytopes, which follows the main steps of McMullen's proof and uses conewise polynomial functions on a simplicial fan [cf. \textit{L.~Billera} and \textit{C.~W.~Lee} [J. Comb. Theory, Ser. A 31, 237--255 (1981; Zbl 0479.52006); \textit{P.~McMullen}, Invent. Math. 113, No.~2, 419--444 (1993; Zbl 0803.52007); \textit{R.~Stanley}, Adv. Math. 35, 236--238 (1980; Zbl 0427.52006); \textit{V. A.~Timorin}, Russ. Math. Surv. 54, No.~2, 381--426 (1999); translation from Usp. Mat. Nauk 54, No.~2, 113--162 (1999; Zbl 0944.52005)].
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- An analogue of the Hodge-Riemann relations for simple convex polytopes
- Combinatorial intersection cohomology for fans.
- scientific article; zbMATH DE number 1901512 (Why is no real title available?)
- Introduction to Toric Varieties. (AM-131)
- On simple polytopes
- The number of faces of a simplicial convex polytope
- The numbers of faces of simplicial polytopes
- The structure of the polytope algebra
- Weights on polytopes
- Simple convex polytopes and the strong Lefschetz theorem
- Combinatoire des simplexes sans singularités. (Combining nonsingular simplexes.)
- Lefschetz properties in algebra, geometry and combinatorics. Abstracts from the workshop held September 27 -- October 3, 2020 (hybrid meeting)
- Hodge-Riemann relations for polytopes. A geometric approach
- scientific article; zbMATH DE number 3979238 (Why is no real title available?)
- Hodge theory in combinatorics
- Hard Lefschetz theorem and Hodge-Riemann relations for intersection cohomology of nonrational polytopes
- Lemke Paths on Simple Polytopes
- FAQ on the g-theorem and the hard Lefschetz theorem for face rings
- Hard Lefschetz properties and distribution of spectra in singularity theory and Ehrhart theory
- A remark on the Hard Lefschetz Theorem for Kähler orbifolds
- Lagrangian geometry of matroids
- Face numbers: the upper bound side of the story
- A short proof of the Hanlon-Hicks-Lazarev Theorem
- How many faces does a (simplicial) polyhedron have?
- Simplicial generation of Chow rings of matroids
- Affine stresses: the partition of unity and Kalai's reconstruction conjectures
- Hard Lefschetz theorem for nonrational polytopes
This page was built for publication: Hard Lefschetz theorem for simple polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q610452)