Pith. sign in

Bounds on the dimension of lineal extensions

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

citation-role summary

background 1

citation-polarity summary

fields

cs.CC 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

background 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.

  • Algorithmic Information Bounds for Distances and Orthogonal Projections cs.CC · 2025-09-05 · conditional · none · ref 3 · internal anchor

    A new proof technique shows distances and orthogonal projections retain at least half of a planar point's Kolmogorov complexity, improving pinned distance dimension bounds to 3/4 s and generalizing Bourgain's theorem.