arXiv Analytics

Sign in

arXiv:math/0010213 [math.AG]AbstractReferencesReviewsResources

On polytopes simple in edges

Vladlen Timorin

Published 2000-10-23, updated 2001-02-13Version 3

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.

Comments: Rewritten. The first version contained fatal errors. 16 pages, to be published in Func. Anal. and Appl
Journal: Funct. Anal. Appl. 35(2001) no. 3, pp. 189-198
Categories: math.AG, math.CO
Subjects: 14M25, 52B05, 14F43
Related articles: Most relevant | Search more
arXiv:math/0112087 [math.AG] (Published 2001-12-09, updated 2002-12-17)
Hard Lefschetz Theorem for Nonrational Polytopes
arXiv:math/0302236 [math.AG] (Published 2003-02-19, updated 2003-09-17)
Hard Lefschetz theorem and Hodge-Riemann relations for intersection cohomology of nonrational polytopes
arXiv:1911.13253 [math.AG] (Published 2019-11-27)
On the hard Lefschetz theorem for pseudoeffective line bundles

Links

Toolbox