On polytopes simple in edges
Vladlen Timorin
math.AGarXiv:math/0010213
Abstract
We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's conjecture for such polytopes.
Create a lesson
Related papers
The Tate Conjecture for Ordinary Calabi-Yau Threefolds
Lukas Brantner
Weighted, GIT and Néron--Tate heights on genus-two moduli and Jacobians
Sajad Salami
Monodromy of Tate-Linear varieties
Livia Grammatica
On the Cohomology Classes of Certain Eisenstein-Kronecker Forms
Zhixuan Sheng, Jie Zhou
Campana strong approximation on generalised Markoff surfaces
Dasheng Wei
Quillen's local parameter conjecture in dimension four
Yunpeng Li