arXiv:math/0111162 [math.CO]AbstractReferencesReviewsResources
Unimodular covers of multiples of polytopes
Winfried Bruns, Joseph Gubeladze
Published 2001-11-14, updated 2002-12-04Version 3
Let P be a d-dimensional lattice polytope. We show that there exists a natural number c_d, only depending on d, such that the multiples cP have a unimodular cover for every natural number c >= c_d. Actually, a subexponential upper bound for c_d is provided, together with an analogous result for unimodular covers of rational cones.
Comments: 13 pages, uses pstricks and mathptm The revised version has been thoroughly rewritten
Categories: math.CO
Related articles: Most relevant | Search more
Norm bounds for Ehrhart polynomial roots
arXiv:1811.03357 [math.CO] (Published 2018-11-08)
Enumeration of lattice polytopes by their volume
arXiv:1004.3970 [math.CO] (Published 2010-04-22)
On Number of Compositions of Natural Numbers