Dimension spectra of lines

DOI10.1007/978-3-319-58741-7_29zbMATH Open1496.03169OpenAlexW2575552205MaRDI QIDQ2011669FDOQ2011669

Authors Neil Lutz, D. M. Stull

Publication date 4 August 2017

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

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Abstract: This paper investigates the algorithmic dimension spectra of lines in the Euclidean plane. Given any line L with slope a and vertical intercept b, the dimension spectrum sp(L) is the set of all effective Hausdorff dimensions of individual points on L. We draw on Kolmogorov complexity and geometrical arguments to show that if the effective Hausdorff dimension dim(a, b) is equal to the effective packing dimension Dim(a, b), then sp(L) contains a unit interval. We also show that, if the dimension dim(a, b) is at least one, then sp(L) is infinite. Together with previous work, this implies that the dimension spectrum of any line is infinite.

Recommendations

• Dimension spectra of lines
• Results on the dimension spectra of planar lines
• scientific article; zbMATH DE number 4086241
• Dimensions and Cantor spectra
• Linear mappings and generalized upper spectrum for dimensions
• On the spectral properties of line distance matrices
• Spectral dimension of spheres
• Essential spectra of linear relations
• Point-Free Spectra of Linear Spreads
• scientific article; zbMATH DE number 749957

Cites work

• scientific article; zbMATH DE number 1303711 (Why is no real title available?)
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• Algorithmic information, plane Kakeya sets, and conditional dimension
• Algorithmic randomness and complexity.
• An introduction to Kolmogorov complexity and its applications
• Connectedness properties of dimension level sets
• Correspondence principles for effective dimensions
• Dimension spectra of random subfractals of self-similar fractals
• Dimensions of Points in Self-Similar Fractals
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Effectively closed sets of measures and randomness
• The dimensions of individual strings and sequences
• Translating the Cantor set by a random real

Cited in

(6)

• Algorithmic Fractal Dimensions in Geometric Measure Theory
• On a metric generalization of the \(tt\)-degrees and effective dimension theory
• Results on the dimension spectra of planar lines
• Dimension spectra of lines
• Vanishing line for the descent spectral sequence
• Point-Free Spectra of Linear Spreads

This page was built for publication: Dimension spectra of lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011669)