Paper detail

Convex-normal (pairs of) polytopes

In 2012 Gubeladze (Adv.\ Math.\ 2012) introduced the notion of k-convex-normal polytopes to show that integral polytopes all of whose edges are longer than 4d(d+1) have the integer decomposition property. In the first part of this paper we show that for lattice polytopes there is no difference between k- and (k+1)-convex-normality (for k >= 3) and improve the bound to 2d(d+1). In the second part we extend the definition to pairs of polytopes and show that for rational polytopes P and Q, where the normal fan of P is a refinement of the normal fan of Q, if every edge e_P of P is at least d times as long as the corresponding edge e_Q of Q, then (P+Q) \cap \Z^d = (P\cap \Z^d) + (Q \cap \Z^d).

preprint2014arXivOpen access

Signal facts

What is known right now

Open access2 authors3 topics

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.