Bounding the dimension of points on a line

DOI10.1016/j.ic.2020.104601zbMath1496.68160arXiv1612.00143OpenAlexW3037357256MaRDI QIDQ2216115

D. M. Stull, Neil Lutz

Publication date: 15 December 2020

Published in: Lecture Notes in Computer Science, Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.00143

zbMATH Keywords

Kolmogorov complexityfractal geometryeffective dimension

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Fractals (28A80)

Related Items

An improved bound for the dimension of \((\alpha,2\alpha)\)-Furstenberg sets ⋮ Dimension spectra of lines1 ⋮ On the packing dimension of Furstenberg sets ⋮ Integrability of orthogonal projections, and applications to Furstenberg sets ⋮ Dimension estimates on circular (s,t)-Furstenberg sets ⋮ Extending the reach of the point-to-set principle ⋮ Dimension and the structure of complexity classes ⋮ Projection theorems using effective dimension ⋮ Higher order information volume of mass function ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Kaufman and Falconer estimates for radial projections and a continuum version of Beck's theorem ⋮ Fractal Intersections and Products via Algorithmic Dimension ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ Who Asked Us? How the Theory of Computing Answers Questions about Analysis ⋮ Dimension spectra of lines ⋮ Unnamed Item ⋮ ON A METRIC GENERALIZATION OF THE tt-DEGREES AND EFFECTIVE DIMENSION THEORY ⋮ Existence of positive solution for Kirchhoff type problem with critical discontinuous nonlinearity ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory

Cites Work

• Dimension spectra of random subfractals of self-similar fractals
• Connectedness properties of dimension level sets
• Correspondence principles for effective dimensions
• Effective Hausdorff dimension in general metric spaces
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• The dimensions of individual strings and sequences
• Mutual Dimension
• Furstenberg sets for a fractal set of directions
• Algorithmic Randomness and Complexity
• Lines missing every random point1
• Connectivity properties of dimension level sets
• Dimensions of Points in Self-Similar Fractals
• Dimension in Complexity Classes
• Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
• Refined Size Estimates for Furstenberg Sets via Hausdorff Measures: A Survey of Some Recent Results
• Computability and Randomness
• Translating the Cantor set by a random real
• An introduction to Kolmogorov complexity and its applications
• Some connections between Falconer's distance set conjecture and sets of Furstenburg type
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item