A new graph-based algorithm approximates the Lagrange and Markov spectra on bounded intervals with Hausdorff error 1/Q in time O(Q^{3d}), where d is the Hausdorff dimension of a related continued fraction Cantor set.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Approximation of the Lagrange and Markov spectra
A new graph-based algorithm approximates the Lagrange and Markov spectra on bounded intervals with Hausdorff error 1/Q in time O(Q^{3d}), where d is the Hausdorff dimension of a related continued fraction Cantor set.