On the Erdős covering problem: the density of the uncovered set

DOI10.1007/s00222-021-01087-5OpenAlexW3211924274MaRDI QIDQ2118065

Marius Tiba, Robert Morris, Béla Bollobás, Julian Sahasrabudhe, Paul N. Balister

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

zbMATH Keywords

arithmetic progressionscovering systemsuncovered setsresidue systems

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Polynomials (irreducibility, etc.) (11R09) Distribution of primes (11N05) Arithmetic progressions (11B25) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

The structure and number of Erdős covering systems ⋮ Composite values of shifted exponentials ⋮ On the jth smallest modulus of a covering system with distinct moduli ⋮ Unnamed Item

Cites Work

• Solution of the minimum modulus problem for covering systems
• On an irreducibility theorem of A. Schinzel associated with coverings of the integers
• The Erdős-Selfridge problem with square-free moduli
• Covering systems with restricted divisibility
• Sieving by large integers and covering systems of congruences
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
• Reducibility of polynomials and covering systems of congruences
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Erdős covering problem: the density of the uncovered set