A Shapley-Folkman lemma for lattice polytopes

2020/12/10 by David Handelman, Handelman, David
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Advanced Combinatorial Mathematics

paper · pdf · doi:10.48550/arxiv.2012.06011

Abstract

Some occurrences of n can be replaced by n-1 in a special case of the Shapley-Folkman lemma.

Related

• Polytopes with few vertices and few facets
• Is there a smooth lattice polytope which does not have the integer decomposition property?
• Lattice point enumeration of polytopes associated to integer compositions
• An Upper Bound Theorem concerning lattice polytopes
• Spanning Lattice Polytopes and the Uniform Position Principle