Under two assumptions, we determine the distribution of the difference between two functions each counting the numbers x that are in a given arithmetic progression modulo q and the...
Arithmetical complexity of a sequence is the number of words of length n that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of l...
Sergey V. Avgustinovich, Julien Cassaigne, Anna E....
The set system of all arithmetic progressions on [n] is known to have a discrepancy of order n1/4. We investigate the discrepancy for the set system S3 n formed by all sums of thr...