Bounds on the dimension of lineal extensions
Ryan E. G. Bushling, Jacob B. Fiedler
TL;DR
This paper investigates how the dimension of a union of line segments changes when each segment is extended to its containing line (lineal extension). In the plane, it establishes a strong packing-dimension result and derives a corollary for the generalized Kakeya problem, then provides partial higher-dimensional bounds via Besicovitch-set estimates. The core method blends effective techniques from Kolmogorov complexity with the point-to-set principle to obtain dimension bounds, including a sharp Hausdorff-bound for s-Hausdorff extensions and a packing-bound equality for 1-Hausdorff extensions. The results connect line-segment extension problems to Furstenberg-type sets and Kakeya-type questions, yielding new quantitative bounds and illustrating intriguing pathological behaviors of s-packing extensions. Collectively, the work advances understanding of how geometric extension interacts with fractal dimensions and offers tools potentially applicable to Kakeya-type phenomena in higher dimensions.
Abstract
Let $E \subseteq \mathbb{R}^n$ be a union of line segments and $F \subseteq \mathbb{R}^n$ the set obtained from $E$ by extending each line segment in $E$ to a full line. Keleti's line segment extension conjecture posits that the Hausdorff dimension of $F$ should equal that of $E$. Working in $\mathbb{R}^2$, we use effective methods to prove a strong packing dimension variant of this conjecture, from which the generalized Kakeya conjecture for packing dimension immediately follows. This is followed by several doubling estimates in higher dimensions and connections to related problems.
