Error approximation for backwards and simple continued fractions (Q6183516)

From MaRDI portal
scientific article; zbMATH DE number 7783307
Language Label Description Also known as
English
Error approximation for backwards and simple continued fractions
scientific article; zbMATH DE number 7783307

    Statements

    Error approximation for backwards and simple continued fractions (English)
    0 references
    0 references
    0 references
    4 January 2024
    0 references
    The authors generalize a transcendence criterion for quasi-palindromic continued fractions due \textit{B. Adamczewski} and \textit{Y. Bugeaud} [Ann. Inst. Fourier 57, No. 5, 1557--1574 (2007; Zbl 1126.11036)] to the field of \(p\)-adic numbers \(\mathbb{Q}_p\). They use the continued fraction for \(\mathbb{Q}_p\) defined in [\textit{A. A. Ruban}, Sib. Math. J. 11, 176--180 (1970; Zbl 0213.32701)]. Let \((a-_i)_{i\geq 1}\) be bounded in \(\mathbb{Q}_p\) (which is equivalent to \(-\nu_p(a_i)\), the usual \(p\)-adic valuation, being bounded) and put \(A=\max\{a_i\mid i\geq 1\},\,B=(A+\sqrt{A^2+4})/2\). Theorem 3.1. Let \(p\) be a prime number and \(\alpha=[0;a_1,a_2,\ldots]_p\) be the continued fraction expansion of a \(p\)-adic number such that \(\mathbf{a}=(a_i)_{i\geq 1}\) is a sequence of rational numbers in \(\mathbb{Z}\left[\frac{1}{p}\right]\cap (0,p)\) satisfying condition \((*)\) and \(a_i\geq \frac{1}{p},\,\geq 1\). Let \(m\) be a positive integer \(\geq 2\), such that \(-\nu_p(a_i)\leq m,\,i\geq 1\). If \[ \frac{5}{m-1}<\frac{\log{p}}{\log{B}}, \] then \(\alpha\) is either quadratic or transcendental. Condition \((*)\) is defined as follows: \(A\) denotes a countable set, \(|W|\) is the length of a finite word \(W\) on the alphabet \(A\), \(W=a_1,\ldots,a_n\) is a \textit{palindrome} if and only if \(\overline{W}=a_n,\ldots,a_1\) satisfies \(\overline{W}=W\), a sequence \(\mathbf{a}=(a_i)_{i\geq 1}\) of elements from \(A\) is identified with the infinite word \(a_1,a_2,\ldots\). The sequence \(\mathbf{a}\) satisfies condition \((*)\) if it is not ultimately periodic and if there exist three sequence of finite words \((U_n)_{n\geq 1}, (V_n)_{n\geq 1}, (W_n)_{n\geq 1}\) such that \begin{itemize} \item For any \(n\geq 1\) the word \(W_nU_nV_n\overline{U}_n\) is a prefix of the word \(\mathbf{a}\), \item The sequence \((|V_n|/|U_n|)_{n\geq 1}\) is bounded from above, \item The sequence \((|W_n|/|U_n|)_{n\geq 1}\) is bounded from above, \item The sequence \((|U_n|)_{n\geq 1}\) is increasing. \end{itemize} The layout of the paper is as follows \S1. Introduction (\(4\) pages). \S2. Reduction to continuants of special form (\(8\) pages). \S3. Upper bounds (\(8\) pages). \S4. Construction of examples (\(6\) pages). References (\(9\) items).
    0 references
    backwards continued fractions
    0 references
    continued fractions
    0 references
    Diophantine approximation
    0 references

    Identifiers