On polytopes simple in edges
Algebraic Geometry
2007-05-23 v3 Combinatorics
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.
Cite
@article{arxiv.math/0010213,
title = {On polytopes simple in edges},
author = {Vladlen Timorin},
journal= {arXiv preprint arXiv:math/0010213},
year = {2007}
}
Comments
Rewritten. The first version contained fatal errors. 16 pages, to be published in Func. Anal. and Appl