Projection theorems using effective dimension
From MaRDI portal
Publication:6124239
DOI10.1016/j.ic.2024.105137OpenAlexW2963214400WikidataQ129800856 ScholiaQ129800856MaRDI QIDQ6124239
Publication date: 27 March 2024
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2024.105137
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correspondence principles for effective dimensions
- Algorithmically independent sequences
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Bounding the dimension of points on a line
- On the packing dimension and category of exceptional sets of orthogonal projections
- Box and packing dimensions of projections and dimension profiles
- Sixty Years of Fractal Projections
- Mutual Dimension
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Dimensions of Points in Self-Similar Fractals
- Von Mises' definition of random sequences reconsidered
- Two counterexamples concerning Hausdorff dimensions of projections
- Hausdorff dimension, orthogonal projections and intersections with planes
- Packing dimensions of projections and dimension profiles
- Dimension in Complexity Classes
- The packing dimension of projections and sections of measures
- Projection theorems for box and packing dimensions
- Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
- Combinatorial proofs of two theorems of Lutz and Stull
- Recent Progress on Dimensions of Projections
- On Hausdorff dimension of projections
- The definition of random sequences
- Some Fundamental Geometrical Properties of Plane Sets of Fractional Dimensions
- Fractal Intersections and Products via Algorithmic Dimension
- An introduction to Kolmogorov complexity and its applications
