3 citations · 3 across the 4 of their papers we have counts for
7 papers · 1 filter
Digital functions along Squares of Prime Numbers
Michael Drmota, Joël Rivat
In the last 20 years the Gelfond conjectures concerning the well distribution of the sum-of-digits function along prime numbers and along squares have been solved and these results…
Prime numbers with an almost prime reverse
Cécile Dartyge, Joël Rivat, Cathy Swaenepoel
Let be an integer greater than or equal to . For any integer , we denote by the reverse of in base , obtained by reversing…
On Finite Pseudorandom Binary Sequences: Functions from a Hardy field
Manfred G. Madritsch, Joël Rivat, Robert F. Tichy
We provide a construction of binary pseudorandom sequences based on Hardy fields as considered by Boshernitzan. In particular we give upper bounds for the well distri…
Reversible primes
Cécile Dartyge, Bruno Martin, Joël Rivat +2
For an -bit positive integer written in binary as where, , , $\vare…
Möbius orthogonality of sequences with maximal entropy
Michael Drmota, Christian Mauduit, Joël Rivat +1
We prove that strongly -multiplicative functions of modulus along squares are asymptotically orthogonal to the Möbius function. This provides examples of sequences having ma…
The measures of pseudorandomness and the NIST tests
László Mérai, Joël Rivat, András Sárközy
A few years ago new quantitative measures of pseudorandomness of binary sequences have been introduced. Since that these measures have been studied in many papers and many construc…
On short sums of trace functions
É. Fouvry, E. Kowalski, Ph. Michel +3
We consider sums of oscillating functions on intervals in cyclic groups of size close to the square root of the size of the group. We first prove non-trivial estimates for interval…