2021/06/08 by Schymura, Matthias, Seidel, Ina, Weltge, Stefan
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
paper · doi:10.48550/arxiv.2106.04432
Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed representations of polytopes, which are typically used to construct small-size linear programs. Motivated by algorithmic implications for the closest vector problem, we study lifts of Voronoi cells of lattices. We construct an explicit d-dimensional lattice such that every lift of the respective Voronoi cell has 2Ω(d / log d) facets. On the positive side, we show that Voronoi cells of d-dimensional root lattices and their dual lattices have lifts with O(d) and O(d log d) facets, respectively. We obtain similar results for spectrahedral lifts.