Uniform Distribution of the Weighted Sum-of-Digits Functions

The higher-dimensional generalization of the weighted q-adic sum-of-digits functions sq,γ (n), n =0, 1, 2,..., covers several important cases of sequences investigated in the theory of uniformly distributed sequences, e.g., d-dimensional van der Corput-Halton or d-dimensional Kronecker sequences. We prove a necessary and sufficient condition for the higher-dimensional weighted q-adic sum-of-digits functions to be uniformly distributed modulo one in terms of a trigonometric product. As applications of our condition we prove some upper estimates of the extreme discrepancies of such sequences, and that the existence of distribution function g(x)= x implies the uniform distribution modulo one of the weighted q-adic sum-of-digits function sq,γ (n), n = 0, 1, 2,... We also prove the uniform distribution modulo one of related sequences h 1 sq, γ (n)+h 2 sq,γ (n +1), where h 1 and h 2 are integers such that h 1 + h 2 ≠ 0 and that the akin two-dimensional sequence sq,γ (n), sq,γ (n +1) cannot be uniformly distributed modulo one if q ≥ 3. The properties of the two-dimensional sequence sq,γ (n),s q,γ (n +1), n =0, 1, 2,..., will be instrumental in the proofs of the final section, where we show how the growth properties of the sequence of weights influence the distribution of values of the weighted sum-of-digits function which in turn imply a new property of the van der Corput sequence.

Log-Like Functions and Uniform Distribution Modulo One

For a function f satisfying f (x) = o((log x) K), K > 0, and a sequence of numbers (qn) n, we prove by assuming several conditions on f that the sequence (αf (qn)) n≥n0 is uniformly distributed modulo one for any nonzero real number α. This generalises some former results due to Too, Goto and Kano where instead of (qn) n the sequence of primes was considered.

Construction of Uniformly Distributed Linear Recurring Sequences Modulo Powers of 2

The aim of the present paper is to provide the background to construct linear recurring sequences with uniform distribution modulo 2s. The theory is developed and an algorithm based on the achieved results is given. The constructed sequences may have arbitrary large period length depending only on the computational power of the used machines.