2 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
Bounding the dimension of exceptional sets for orthogonal projections
Peter Cholak, Marianna Csornyei, Neil Lutz +3
It is well known that if is an analytic set of Hausdorff dimension , then for a.e.\ , where denotes…