Convex normality of rational polytopes with long edges
classification
🧮 math.CO
math.NT
keywords
latticepolytopesrationalconvexedgeedgesevenleast
read the original abstract
We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope P has lattice length at least 4d(d+1) then P is normal. This answers in the positive a question raised in 2007. If P is a lattice simplex whose edges have lattice lengths at least d(d+1) then P is even covered by lattice parallelepipeds. For the approach developed here, it is necessary to involve rational polytopes even for applications to lattice polytopes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.