Metraipolis › archive › dc_db20dca410a2
On the weighted hard-core model and Rado's covering problem for congruent Euclidean balls — arXiv:2608.09744
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.09744
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:07:12.605Z
- SHA-256 of the archived text
637fe54893ffd0a13b8e34ca38b0fc43741cad25f6646c1ea34a4682b158366f- Stable URL of this page
https://metraipolis.com/documento/dc_db20dca410a2
How to cite
On the weighted hard-core model and Rado's covering problem for congruent Euclidean balls — arXiv:2608.09744 — arXiv (en), https://arxiv.org/abs/2608.09744 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_db20dca410a2 (Metraipolis archive dc_db20dca410a2, sha256 637fe54893ffd0a13b8e34ca38b0fc43741cad25f6646c1ea34a4682b158366f)
BibTeX
@misc{dcdb20dca410a2,
title = {On the weighted hard-core model and Rado's covering problem for congruent Euclidean balls — arXiv:2608.09744},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.09744},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_db20dca410a2; sha256 637fe54893ffd0a13b8e34ca38b0fc43741cad25f6646c1ea34a4682b158366f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09744. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $K$ be a symmetric convex body in $\mathbb{R}^d$ and let $f(K)$ denote the largest constant $c$ such that every finite collection of translates of $K$ contains a pairwise disjoint subcollection whose total volume is at least $c$ times the volume of the union of the original collection. The classical Vitali covering lemma gives $f(K)\geq3^{-d}$. In this paper, we establish two improvements. First, by a purely combinatorial argument, we prove that $$ f(K)\geq \frac{2}{3^d + 2^d} $$ for every symmetric convex body $K$. This improves the Vitali bound by a factor tending to $2$ as $d$ tends to infinity. Second, using a weighted hard-core model together with a weighted geometric estimate for intersections of Euclidean balls, we show that, for all sufficiently large $d$, $$ f(B^d)\geq \left( \log\frac{3}{1+\sqrt3} -O\left(\frac{\log d}{d}\right) \right)d\,3^{-d}, $$ where $B^d$ is the unit Euclidean ball in $\mathbb{R}^d$. Thus, the classical lower bound is improved by a factor of order $d$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.PR).
Categorie arXiv: Metric Geometry (math.MG) ; Discrete Mathematics (cs.DM); Classical Analysis and ODEs (math.CA); Combinatorics (math.CO); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2608.09744 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:04:32.205Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).