Papers
Topics
Authors
Recent
2000 character limit reached

Selberg's sieve of irregular density (2206.03479v1)

Published 7 Jun 2022 in math.NT

Abstract: We study certain aspects of the Selberg sieve, in particular when sifting by rather thin sets of primes. We derive new results for the lower bound sieve suited especially for this setup and we apply them in particular to give a new sieve-propelled proof of Linnik's theorem on the least prime in an arithmetic progression in the case of the presence of exceptional zeros.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.