A polynomial time algorithm for the Hausdorff dimension of continued fraction Cantor sets (Q1914021)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A polynomial time algorithm for the Hausdorff dimension of continued fraction Cantor sets
scientific article

    Statements

    A polynomial time algorithm for the Hausdorff dimension of continued fraction Cantor sets (English)
    0 references
    0 references
    9 July 1996
    0 references
    For each \(A\subset \mathbb{N}\), the set \(E_A \subset (0,1)\) is defined to be those irrationals \(\alpha\) with continued fraction expansion given by \(\alpha = [0;a_1,a_2, \dots]\) with \(a_i\in A\). When the cardinality of \(A\) is finite, such \(\alpha\) are badly approximable and \(E_A\) is of measure 0. When \(A\) has just one element, \(E_A\) consists of a single quadratic irrational. When \(2\leq \text{Card} A \leq N\), \(E_A\) is a Cantor-type set with a `fractal dust' structure. The author presents a polynomial time algorithm for determining the Hausdorff dimension of \(E_A\) to within \(\pm 2^{-N}\) using \(O(N^7)\) operations. An implementation of the code in Mathematica is included. The Hausdorff dimension is 1/2 the unique value for which a function \(\lambda\) related to a general zeta function is unity. In an interesting application of operator theory, the method uses results concerning the spectrum of an operator associated with the invariant measure for the continued fraction process. A number of conjectures suggested by calculations are included.
    0 references
    Cantor sets
    0 references
    continued fraction
    0 references
    algorithm
    0 references
    Hausdorff dimension
    0 references
    spectrum of an operator
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references