On continued fraction expansion of potential counterexamples to p-adic Littlewood conjecture
Abstract
The p-adic Littlewood conjecture (PLC) states that q∞ q· |q|p · ||qx|| = 0 for every prime p and every real x. Let wCF(x) be an infinite word composed of the continued fraction expansion of x and let T be the standard left shift map. Assuming that x is a counterexample to PLC we get several restrictions on limit elements of the sequence \Tn wCF(x)\n∈N. As a consequence we show that for any such limit element w we must have n∞ P(w,n) - n = ∞ where P(w,n) is a word complexity of w. We also show that w can not be among a certain collection of recursively constructed words.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.