Learn More
We study the Minkowski length L(P) of a lattice polytope P , which is defined to be the largest number of non-trivial primitive segments whose Minkowski sum lies in P. The Minkowski length represents the largest possible number of factors in a factorization of polynomials with exponent vectors in P , and shows up in lower bounds for the minimum distance of(More)
  • 1