arXiv · 2112.12202
Covering three-tori with cubes
Abstract
Let $μ(\varepsilon)$ be the minimum number of cubes of side $\varepsilon$ needed to cover the unit three-torus $[\mathbb{R}/\mathbb{Z}]^3$. We prove new lower and upper bounds for $μ(\varepsilon)$ and find the exact value for all $\varepsilon\geq\frac{7}{15}$ and all $\varepsilon\in\left[\frac{1}{r+1/(r^2+r+1)},\frac{1}{r-1/(r^2-1)}\right)$ for any integer $r\geq 2$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ilya Bogdanov, Oleg Grigoryan, Maksim Zhukovskii. 2022-11-06. Covering three-tori with cubes. https://arxiv.org/abs/2112.12202
Cite the original work for its findings. Save a collection to share your selection of sources.