The larger sieve and polynomial congruences
Patrick Letendre

TL;DR
This paper improves Gallagher's larger sieve, extends it to higher dimensions, and provides new upper bounds for solutions to polynomial congruences, advancing understanding in sieve methods and polynomial equations.
Contribution
The authors enhance the larger sieve technique, generalize it to multiple dimensions, and derive novel bounds for polynomial congruence solutions.
Findings
Improved version of Gallagher's larger sieve.
Extension of the sieve to higher dimensions.
New upper bounds for polynomial congruence solutions.
Abstract
We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Limits and Structures in Graph Theory
