11 citations · 14 across the 7 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.NT2026
The large sieve through Parseval, Large sifted sets are regular
Olivier Ramaré
We modify the approach to the arithmetical form of the large sieve by relying on the Parseval identity rather than on an approximate Bessel inequality and as a consequence, we prov…
math.NT2026★ 3 cited
Improving on the Brun-Titchmarsh Theorem
Olvier Ramaré, Jan Christoph Schlage-Puchta
We prove that the number of primes in an interval of length is at most when is large enough. This is obtained through a sieving process which can be seen…