On the Erdős covering problem: the density of the uncovered set
DOI10.1007/S00222-021-01087-5OpenAlexW3211924274MaRDI QIDQ2118065FDOQ2118065
Marius Tiba, Paul Balister, Robert Morris, Béla Bollobás, Julian Sahasrabudhe
Publication date: 22 March 2022
Published in: Inventiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.03547
Recommendations
Congruences; primitive roots; residue systems (11A07) Combinatorial aspects of packing and covering (05B40) Arithmetic progressions (11B25) Distribution of primes (11N05) Polynomials (irreducibility, etc.) (11R09)
Cites Work
- Title not available (Why is that?)
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
- Title not available (Why is that?)
- Sieving by large integers and covering systems of congruences
- Covering systems with restricted divisibility
- Solution of the minimum modulus problem for covering systems
- On an irreducibility theorem of A. Schinzel associated with coverings of the integers
- Reducibility of polynomials and covering systems of congruences
- The Erdős-Selfridge problem with square-free moduli
Cited In (14)
- On a problem of P. Erdos and S. Stein
- On the Erd\H{o}s Covering Problem: the density of the uncovered set
- The structure and number of Erdős covering systems
- On covering systems of polynomial rings over finite fields
- Density, forcing, and the covering problem
- On homogeneous covering congruences
- Covering Systems of Congruences
- Composite values of shifted exponentials
- Covering intervals with arithmetic progressions
- Title not available (Why is that?)
- On Erdős covering systems in global function fields
- On the jth smallest modulus of a covering system with distinct moduli
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: On the Erdős covering problem: the density of the uncovered set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118065)
