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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.