At most nine lines in Euclidean three-space have pairwise distance one
Abstract
J.E. Littlewood posed the question of how many infinite circular cylinders of unit radius can be arranged so that each touches all the others. We give a computer-free proof that one cannot find ten such cylinders. This improves a known result, namely that there are no eleven such cylinders, which was obtained making partial use of computer verification.
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.