2000 character limit reached
A new upper bound for mutually touching infinite cylinders
Published 24 Jun 2025 in math.MG and math.CO | (2506.19309v1)
Abstract: Let $N$ denote the maximum number of congruent infinite cylinders that can be arranged in $\mathbb{R}3$ so that every pair of cylinders touches each other. Littlewood posed the question of whether $N=7$, which remains unsolved. In this paper, we prove that $N\leq 18$, improving the previously known upper bound of $24$ established by A. Bezdek.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.