Covering three-tori with cubes

Abstract

Let μ() be the minimum number of cubes of side needed to cover the unit three-torus [R/Z]3. We prove new lower and upper bounds for μ() and find the exact value for all ≥715 and all ∈[1r+1/(r2+r+1),1r-1/(r2-1)) for any integer r≥ 2.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…