Pith. sign in

REVIEW 1 cited by

Bounds on the dimension of lineal extensions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.16315 v3 pith:MTFL5E7C submitted 2024-04-25 math.CA

classification math.CA
keywords dimensionlineconjecturemathbbpackingsegmentsubseteqbounds
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Algorithmic Information Bounds for Distances and Orthogonal Projections

    cs.CC 2025-09 conditional novelty 7.0 of 10

    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.

Pith tools