D. Stull

collaborators

5 papers

cs.CC2026

Algorithmic Information Bounds for Distances and Orthogonal Projections

Peter Cholak, Marianna CsÃ¶rnyei, Neil Lutz +3

We introduce a new technique for proving bounds on the Kolmogorov complexity of geometric objects in Euclidean space, such as points and lines. We apply this technique to prove two…

math.CA2025

Improved bounds for radial projections in the plane

Marianna Csornyei, D. M. Stull

We improve the best known lower bound for the dimension of radial projections of sets in the plane. We show that if $X, Y$ are Borel sets in $R^{2}$ , $X$ is not contained in any line…

math.CA2025

Bounding the dimension of exceptional sets for orthogonal projections

Peter Cholak, Marianna Csornyei, Neil Lutz +3

It is well known that if $A \subseteq R^{n}$ is an analytic set of Hausdorff dimension $a$ , then $dim_{H} (I ¨ _{V} A) = min {a, k}$ for a.e.\ $V \in G (n, k)$ , where $G (n, k)$ denotes…

math.CA2025

Pinned distances of planar sets with low dimension

Jacob B. Fiedler, D. M. Stull

In this paper, we give improved bounds on the Hausdorff dimension of pinned distance sets of planar sets with dimension strictly less than one. As the planar set becomes more regul…

math.CA2025

Universal Sets for Projections

Jacob B. Fiedler, D. M. Stull

We investigate variants of Marstrand's projection theorem that hold for sets of directions and classes of sets in $R^{2}$ . We say that a set of directions $D \subseteq\mathc…