Universal convex coverings

DOI10.1112/BLMS/BDP076zbMATH Open1203.11049arXiv0812.3525OpenAlexW3103488244MaRDI QIDQ5852011FDOQ5852011

Roland Bacher

Publication date: 26 January 2010

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Abstract: In every dimension $dge1$, we establish the existence of a constant $v_d>0$ and of a subset $mathcal{U}_d$ of $mathbb{R}^d$ such that the following holds: $mathcalC+mathcal{U}_d=mathbb{R}^d$ for every convex set $mathcalCsubsetmathbb{R}^d$ of volume at least $v_d$ and $mathcal{U}_d$ contains at most $log(r{)}^{d-1}{r}^d$ points at distance at most $r$ from the origin, for every large $r$.

Full work available at URL: https://arxiv.org/abs/0812.3525

zbMATH Keywords

convex coveringsuniversal convex covering

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice packing and covering (number-theoretic aspects) (11H31)

Cited In (2)

• The universal covers of certain semibiplanes
• On the density of the thinnest covering of \(\mathbb{R}^n\)

This page was built for publication: Universal convex coverings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5852011)