Difference between families of weakly and strongly maximal integral lattice-free polytopes

Publication date 14 December 2022

Abstract: A

d

-dimensional closed convex set

K

in

m a t h b b R^{d}

is said to be lattice-free if the interior of

K

is disjoint with

m a t h b b Z^{d}

. We consider the following two families of lattice-free polytopes: the family

m a t h c a l L^{d}

of integral lattice-free polytopes in

m a t h b b R^{d}

that are not properly contained in another integral lattice-free polytope and its subfamily

m a t h c a l M^{d}

consisting of integral lattice-free polytopes in

m a t h b b R^{d}

which are not properly contained in another lattice-free set. It is known that

m a t h c a l M^{d} = m a t h c a l L^{d}

holds for

d l e 3

and, for each

d g e 4

,

m a t h c a l M^{d}

is a proper subfamily of

m a t h c a l L^{d}

. We derive a super-exponential lower bound on the number of polytopes in

m a t h c a l L^{d} s e t m i n u s m a t h c a l M^{d}

(with standard identification of integral polytopes up to affine unimodular transformations).

Recommendations

Cites work

This page was built for publication: Difference between families of weakly and strongly maximal integral lattice-free polytopes