2000 character limit reached
On distribution modulo 1 of the sum of powers of a Salem number (1506.08872v1)
Published 29 Jun 2015 in math.NT
Abstract: Let $\theta $ be a Salem number and $P(x)$ a polynomial with integer coefficients. It is well-known that the sequence $(\thetan)$ modulo 1 is dense but not uniformly distributed. In this article we discuss the sequence $(P(\thetan))$ modulo 1. Our first approach is computational and consists in estimating the number of n so that the fractional part of $(P(\thetan))$ falls into a subinterval of the partition of $[0,1]$. If Salem number is of degree 4 we can obtain explicit density function of the sequence, using an algorithm which is also given. Some examples confirm that these two approaches give the same result.