Covering three-tori with cubes
Ilya Bogdanov, Oleg Grigoryan, Maksim Zhukovskii

TL;DR
This paper investigates the minimum number of cubes needed to cover the three-dimensional torus, establishing new bounds and exact values for specific cube sizes, advancing understanding of geometric coverings in topology.
Contribution
It provides new lower and upper bounds for the covering number and determines exact values for a range of cube sizes on the three-torus.
Findings
Established new bounds for (5)
Derived exact covering numbers for specific ranges
Extended understanding of geometric coverings in topology
Abstract
Let be the minimum number of cubes of side needed to cover the unit three-torus . We prove new lower and upper bounds for and find the exact value for all and all for any integer .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Coding theory and cryptography · Finite Group Theory Research
