Related papers: Uniform distribution and algorithmic randomness

We elaborate the notions of Martin-L\"of and Schnorr randomness for real numbers in terms of uniform distribution of sequences. We give a necessary condition for a real number to be Schnorr random expressed in terms of classical uniform…

By a classical result of Weyl, for any increasing sequence $(n_k)_{k \geq 1}$ of integers the sequence of fractional parts $(\{n_k x\})_{k \geq 1}$ is uniformly distributed modulo 1 for almost all $x \in [0,1]$. Except for a few special…

A classical theorem of Weyl states that any polynomial with an irrational coefficient other than the constant term is uniformly distributed mod 1. We prove a new function field analogue of this statement, confirming a conjecture of L\^{e},…

One of the fundamental theorems of uniform distribution theory states that the fractional parts of the sequence $(n \alpha)_{n \geq 1}$ are uniformly distributed modulo one (u.d. mod 1) for every irrational number $\alpha$. Another…

Weyl's classical equidistribution theorem states that real-valued polynomial sequences are uniformly distributed modulo 1, unless all non-constant coefficients are rational. A continuous function between two topological groups is called a…

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

Given an increasing sequence of integers a(n), it is known (due to Weyl) that for almost all reals t, the fractional parts of the dilated sequence t*a(n) are uniformly distributed in the unit interval. Some effort has been made recently to…

We examine the uniform distribution theory of H. Weyl when there is a periodic perturbation present. As opposed to the classical setting, in this case the conditions for (mod 1) density and (mod 1) uniform distribution turn out to be…

We study the uniform distribution of the polynomial sequence $\lambda(P)=(\lfloor P(k) \rfloor )_{k\geq 1}$ modulo integers, where $P(x)$ is a polynomial with real coefficients. In the nonlinear case, we show that $\lambda(P)$ is uniformly…

We obtain multidimensional metric uniform distribution results involving sequences in ${\mathbb R}^k$ parametrized by analytic curves. Our theorems extend the classical theorems of Weyl and Koksma in a variety of ways. One of our main…

In probability theory, there is a tendency to treat one random variable with a given distribution as being just as good as any other. By and large this is fine because probability is (mostly) concerned with distributional properties of…

The classical theorem of Wendel provides an exact formula for the probability that the convex hull of independent symmetrically distributed vectors in ${\mathbb R}^d$ contains the origin as long as the distributions of the vectors are…

The theory of equidistribution is about hundred years old, and has been developed primarily by number theorists and theoretical computer scientists. A motivated uninitiated peer could encounter difficulties perusing the literature, due to…

Generalized polynomials are mappings obtained from the conventional polynomials by the use of operations of addition, multiplication and taking the integer part. Extending the classical theorem of H. Weyl on equidistribution of polynomials,…

In 1949 Wall showed that $x = 0.d_1d_2d_3 \dots$ is normal if and only if $(0.d_nd_{n+1}d_{n+2} \dots)_n$ is a uniformly distributed sequence. In this article, we consider sequences which are slight variants on this. In particular, we show…

The famous \emph{circular law} asserts that if $M_n$ is an $n \times n$ matrix with iid complex entries of mean zero and unit variance, then the empirical spectral distribution (ESD) of the normalized matrix $\frac{1}{\sqrt{n}} M_n$…

We show that the sequence $(\alpha n)_{n\in \mathcal{B}}$ is uniformly distributed modulo 1, for every irrational $\alpha$, provided $\mathcal{B}$ belongs to a certain family of integer sequences, which includes the prime, almost prime,…

We study divisibility properties of a set $\{f_1(\mathbf{U}_n^{(s)}),\ldots,f_m(\mathbf{U}_n^{(s)})\}$, where $f_1,\ldots,f_m$ are polynomials in $s$ variables over $\mathbb{Z}$ and $\mathbf{U}_n^{(s)}$ is a point picked uniformly at random…

Consider $n$ independent random numbers with a uniform distribution on $[0,1]$. The number of them that exceed their mean is shown to have an Eulerian distribution, i.e., it is described by the Eulerian numbers. This is related to, but…

The distribution of the sum of independent identically distributed uniform random variables is well-known. However, it is sometimes necessary to analyze data which have been drawn from different uniform distributions. By inverting the…