The point-to-set principle and the dimensions of Hamel bases

DOI10.3233/com-210383MaRDI QIDQ6594828

Renrui Qi, Liang Yu, Jack H. Lutz

Publication date: 29 August 2024

Published in: Computability (Search for Journal in Brave)

zbMATH Keywords

Hausdorff dimensionHamel basespoint-to-set principlealgorithmic fractal dimension

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur la question de la mesurabilité de la base de M. Hamel.
• Untersuchungen über die Grundlagen der Mengenlehre. I.
• Eine Basis aller Zahlen und die unstetigen Lösungen der Funktionalgleichung: \(f(x+y) =f(x) +f(y)\).
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• The dimensions of individual strings and sequences
• Bounding the dimension of points on a line
• Algorithmic Randomness and Complexity
• Who Asked Us? How the Theory of Computing Answers Questions about Analysis
• Dimensions of Points in Self-Similar Fractals
• Kolmogorov Complexity and Algorithmic Randomness
• Sums of Cantor sets yielding an interval
• Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
• Algorithmic Fractal Dimensions in Geometric Measure Theory
• Capacitability for Co-Analytic Sets
• Measure and other properties of a Hamel basis
• Fractal Intersections and Products via Algorithmic Dimension
• An introduction to Kolmogorov complexity and its applications
• Optimal oracles for point-to-set principles

This page was built for publication: The point-to-set principle and the dimensions of Hamel bases