Elvira Mayordomo

collaborators

4 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.GR2026

Fractal dimensions and profinite groups

Elvira Mayordomo, Andre Nies

Let $T$ be a finitely branching rooted tree such that any node has at least two successors. The path space $[T]$ is an ultrametric space: for distinct paths $f, g$ let $d(f,g)= 1/|T…

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.LO2025

Normality, Relativization, and Randomness

Wesley Calvert, Emma Grunner, Elvira Mayordomo +2

Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized…