On continued fraction expansion of potential counterexamples to $p$-adic Littlewood conjecture
Dzmitry Badziahin

TL;DR
This paper investigates the structure of potential counterexamples to the $p$-adic Littlewood conjecture by analyzing their continued fraction expansions and showing restrictions on their limit behaviors and complexity.
Contribution
It introduces new restrictions on the continued fraction expansions of counterexamples to the $p$-adic Littlewood conjecture, including complexity growth and exclusion from certain recursive word classes.
Findings
Limit elements of the shift orbit have unbounded complexity growth.
Counterexamples cannot be among certain recursively constructed words.
Provides structural constraints on potential counterexamples.
Abstract
The -adic Littlewood conjecture (PLC) states that for every prime and every real . Let be an infinite word composed of the continued fraction expansion of and let be the standard left shift map. Assuming that is a counterexample to PLC we get several restrictions on limit elements of the sequence . As a consequence we show that for any such limit element we must have where is a word complexity of . We also show that can not be among a certain collection of recursively constructed words.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · semigroups and automata theory · Cellular Automata and Applications
