Abstract
AbstractMany 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^{\Omega (d/{\log d})}$$
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 $${{\mathcal {O}}}(d)$$
O
(
d
)
and $${{\mathcal {O}}}(d \log d)$$
O
(
d
log
d
)
facets, respectively. We obtain similar results for spectrahedral lifts.
Funder
deutsche forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference48 articles.
1. Aharonov, D., Regev, O.: Lattice problems in NP $${\cap }$$ coNP. J. ACM 52(5), 749–765 (2005)
2. Aprile, M., Fiorini, S.: Regular matroids have polynomial extension complexity. Math. Oper. Res. 47(1), 540–559 (2022)
3. Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3–51 (1979)
4. Birkhoff, G.: Tres observaciones sobre el algebra lineal. Univ. Nac. Tucuman Ser. A 5, 147–154 (1946)
5. Bogomolov, Yu., Fiorini, S., Maksimenko, A., Pashkovich, K.: Small extended formulations for cyclic polytopes. Discrete Comput. Geom. 53(4), 809–816 (2015)