Reducing the Large Set Threshold for the Basu-Oertel Conjecture

Type: Preprint

Publication Date: 2024-11-02

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2411.11864

Abstract

In 1960, Gr\"{u}nbaum proved that for any convex body $C\subset\mathbb{R}^d$ and every halfspace $H$ containing the centroid of $C$, one has that the volume of $H\cap C$ is at least a $\frac{1}{e}$-fraction of the volume of $C$. Recently, in 2017, Basu and Oertel conjectured that a similar result holds for mixed-integer convex sets. Concretely, they proposed that for any convex body $C\subset \mathbb{R}^{n+d}$, there should exist a point $\mathbf{x} \in S=C\cap(\mathbb{Z}^{n}\times\mathbb{R}^d)$ such that for every halfspace $H$ containing $\mathbf{x}$, one has that \[ \mathcal{H}_d(H\cap S) \geq \frac{1}{2^n}\frac{1}{e}\mathcal{H}_d(S), \] where $\mathcal{H}^d$ denotes the $d$-dimensional Hausdorff measure. While the conjecture remains open, Basu and Oertel proved that the above inequality holds true for sufficiently large sets, in terms of a measure known as the \emph{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 the Basu-Oertel conjecture holds true.

Locations

  • arXiv (Cornell University) - View - PDF

Similar Works

Action Title Year Authors
+ Improved bounds for Hadwiger's covering problem via thin-shell estimates 2018 Han Huang
Boaz A. Slomka
Tomasz Tkocz
Beatrice-Helen Vritsiou
+ Improved bounds for Hadwiger's covering problem via thin-shell estimates 2018 Han Huang
Boaz A. Slomka
Tomasz Tkocz
Beatrice-Helen Vritsiou
+ PDF Chat None 2022 Matthieu Fradelizi
Zsolt LÃ¥ngi
Artem Zvavitch
+ PDF Chat Measuring the convexity of compact sumsets with the Schneider non-convexity index 2024 Mark Meyer
+ PDF Chat On the Beer Index of Convexity and Its Variants 2016 Martin Balko
VĂ­t JelĂ­nek
PĂĄvel Valtr
Bartosz Walczak
+ Sharpening an Estimate of the Size of the Sumset of a Convex Set 2020 Konstantin Olmezov
+ Tight bounds on discrete quantitative Helly numbers 2017 Gennadiy Averkov
Bernardo GonzĂĄlez Merino
Ingo Paschke
Matthias Schymura
Stefan Weltge
+ Convex polytopes in restricted point sets in R^d 2025 Boris Bukh
Dong Zichao
+ Covering and packing with homothets of limited capacity 2022 Oriol Solé Pi
+ Mahler's work on the geometry of numbers 2018 Jan‐Hendrik Evertse
+ Large Convex sets in Difference sets 2023 Krishnendu Bhowmick
Ben Lund
Oliver Roche‐Newton
+ Improved bounds for Hadwiger’s covering problem via thin-shell estimates 2021 Han Huang
Boaz A. Slomka
Tomasz Tkocz
Beatrice-Helen Vritsiou
+ A m\'elange of diameter Helly-type theorems 2020 Travis Dillon
Pablo SoberĂłn
+ Some properties of sets in the plane closed under linear extrapolation by a fixed parameter 2012 Stephen A. Fenner
Frederic Green
Rohit Gurjar
Steven Homer
+ A mélange of diameter Helly-type theorems 2020 Travis Dillon
Pablo SoberĂłn
+ An improved result for Falconer's distance set problem in even dimensions 2020 Xiumin Du
Alex Iosevich
Yumeng Ou
Hong Wang
Ruixiang Zhang
+ PDF Chat Approximations of convex bodies by measure-generated sets 2018 Han Huang
Boaz A. Slomka
+ Effective results on the size and structure of sumsets 2021 Andrew Granville
George Shakan
Aled Walker
+ PDF Chat Mahler’s work on the geometry of numbers 2019 Jan‐Hendrik Evertse
+ MORE ON YET ANOTHER IDEAL VERSION OF THE BOUNDING NUMBER 2025 Adam Kwela

Works That Cite This (0)

Action Title Year Authors

Works Cited by This (0)

Action Title Year Authors