Uniform Distribution and Diophantine Inequalities.
Any sequence of distinct numbers from [0,1] generates a binary tree by storing the numbers consecutively at the nodes according to a left-right algorithm (or equivalently by sorting the numbers according to the Quicksort algorithm). Let be the height of the tree generated by ObviouslyIf the sequences are generated by independent random variables having the uniform distribution on [0, 1], then it is well known that there exists > such that as for almost all sequences . Recently...
In this partly expository paper we study van der Corput sets in , with a focus on connections with harmonic analysis and recurrence properties of measure preserving dynamical systems. We prove multidimensional versions of some classical results obtained for d = 1 by Kamae and M. Mendès France and by Ruzsa, establish new characterizations, introduce and discuss some modifications of van der Corput sets which correspond to various notions of recurrence, provide numerous examples and formulate some...
Generalized van der Corput sequences are onedimensional, infinite sequences in the unit interval. They are generated from permutations in integer base and are the building blocks of the multi-dimensional Halton sequences. Motivated by recent progress of Atanassov on the uniform distribution behavior of Halton sequences, we study, among others, permutations of the form for coprime integers and . We show that multipliers that either divide or generate van der Corput sequences with weak...