Palindromic Prefixes and Diophantine Approximation
Number Theory
2012-02-13 v3 Combinatorics
Abstract
This text is devoted to simultaneous approximation to and by rational numbers with the same denominator, where is a non-quadratic real number. We focus on an exponent that measures the quality of such approximations (when they are exceptionally good). We prove that takes the same set of values as a combinatorial quantity that measures the abundance of palindrome prefixes in an infinite word . This allows us to give a precise exposition of Roy's palindrome prefix method. The main tools we use are Davenport-Schmidt's sequence of minimal points and Roy's bracket operation.
Keywords
Cite
@article{arxiv.math/0509508,
title = {Palindromic Prefixes and Diophantine Approximation},
author = {Stéphane Fischler},
journal= {arXiv preprint arXiv:math/0509508},
year = {2012}
}
Comments
31 pages; major improvements in the redaction ; to appear in Monatshefte Math