Paper detail

On distribution modulo 1 of the sum of powers of a Salem number

Let $θ$ be a Salem number and $P(x)$ a polynomial with integer coefficients. It is well-known that the sequence $(θ^n)$ modulo 1 is dense but not uniformly distributed. In this article we discuss the sequence $(P(θ^n))$ modulo 1. Our first approach is computational and consists in estimating the number of n so that the fractional part of $(P(θ^n))$ 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.

preprint2015arXivOpen access

Signal facts

What is known right now

Open access1 author1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.