A Continuum Erd\H{o}s-Beck Theorem
Paige Bright, Caleb Marshall

TL;DR
This paper extends the Erd ext{"o}s--Beck Theorem to fractal sets in all dimensions, providing new lower bounds on the dimension of line sets containing points of the fractal, and introduces the concept of the trapping number.
Contribution
It generalizes the Erd ext{"o}s--Beck Theorem to fractal sets, introduces the trapping number, and proposes a conjecture for the exact dimension of line sets.
Findings
Established lower bounds for the dimension of line sets in fractal sets.
Introduced the trapping number to refine bounds on line set dimensions.
Proposed a conjecture for the exact dimension of line sets in fractals.
Abstract
We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let Borel and be an integer. Let for every -dimensional hyperplane , and let be the set of lines that contain at least two distinct points of . Then, a recent result of Ren shows If we instead have that is not a subset of any -plane, and we instead obtain the bound We then strengthen this lower bound by introducing the notion of the "trapping number" of a set, , and obtain \[ \dim \mathcal L(X) \geq \max\{\dim X + t, \min\{2\dim X, 2(T(X)-1)\}\}, \]…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · Matrix Theory and Algorithms · Rings, Modules, and Algebras
