Reducing the Large Set Threshold for Oertel's Conjecture on the Mixed-Integer Volume
Abstract
In 1960, Grünbaum proved that for any convex body CâRd and every halfspace H containing the centroid of C, one has that the volume of Hâ©C is at least a 1e-fraction of the volume of C. Recently, in 2014, Oertel conjectured that a similar result holds for mixed-integer convex sets. Concretely, he proposed that for any convex body CâRn+d, there should exist a point xâS=Câ©(ZnÃRd) such that for every halfspace H containing x, one has that Hd(Hâ©S)â¥12n1eHd(S),where Hd denotes the d-dimensional Hausdorff measure. While the conjecture remains open, Basu and Oertel proved in 2017 that the above inequality holds true for sufficiently large sets, in terms of a measure known as the lattice width of a set. In this work, by following a geometric approach, we improve this result by substantially reducing the threshold at which a set can be considered large. We reduce this threshold from an exponential to a polynomial dependency on the dimension, therefore significantly enlarging the family of mixed-integer convex sets over which Oertelâs conjecture holds true. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
Más información
| Título según WOS: | Reducing the Large Set Threshold for Oertel's Conjecture on the Mixed-Integer Volume |
| Título de la Revista: | Lecture Notes in Computer Science |
| Volumen: | 15620 LNCS |
| Editorial: | Springer Science and Business Media Deutschland GmbH |
| Fecha de publicación: | 2025 |
| Página de inicio: | 199 |
| Página final: | 212 |
| Idioma: | English |
| DOI: |
10.1007/978-3-031-93112-3_15 |
| Notas: | ISI |