Metric results on the discrepancy of sequences $\left(a_{n} \alpha\right)_{n \geq 1}$ modulo one for integer sequences $\left(a_{n}\right)_{n \geq 1}$ of polynomial growth
Christoph Aistleitner, Gerhard Larcher

TL;DR
This paper investigates the discrepancy of sequences formed by multiplying polynomial sequences by a real number and examines their distribution modulo one, providing new bounds and insights for sequences of polynomial growth.
Contribution
The paper establishes sharp bounds on the discrepancy of fractional parts of polynomial sequences multiplied by real numbers, extending previous results beyond lacunary sequences.
Findings
Discrepancy bounds for polynomial sequences are derived.
Results apply to all polynomials of degree at least 2.
Provides new insights into distribution modulo one for polynomial sequences.
Abstract
An important result of H. Weyl states that for every sequence of distinct positive integers the sequence of fractional parts of is uniformly distributed modulo one for almost all . However, in general it is a very hard problem to calculate the precise order of convergence of the discrepancy of for almost all . In particular it is very difficult to give sharp lower bounds for the speed of convergence. Until now this was only carried out for lacunary sequences and for some special cases such as the Kronecker sequence or the sequence . In the present paper we answer the question for a large class of sequences…
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.
