English

Covering three-tori with cubes

Combinatorics 2022-11-08 v2

Abstract

Let μ(ε)\mu(\varepsilon) be the minimum number of cubes of side ε\varepsilon needed to cover the unit three-torus [R/Z]3[\mathbb{R}/\mathbb{Z}]^3. We prove new lower and upper bounds for μ(ε)\mu(\varepsilon) and find the exact value for all ε715\varepsilon\geq\frac{7}{15} and all ε[1r+1/(r2+r+1),1r1/(r21))\varepsilon\in\left[\frac{1}{r+1/(r^2+r+1)},\frac{1}{r-1/(r^2-1)}\right) for any integer r2r\geq 2.

Cite

@article{arxiv.2112.12202,
  title  = {Covering three-tori with cubes},
  author = {Ilya Bogdanov and Oleg Grigoryan and Maksim Zhukovskii},
  journal= {arXiv preprint arXiv:2112.12202},
  year   = {2022}
}
R2 v1 2026-06-24T08:28:40.667Z