The structure and number of Erdős covering systems

DOI10.4171/jems/1357arXiv1904.04806MaRDI QIDQ6151862

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

Publication date: 11 March 2024

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.04806

zbMATH Keywords

arithmetic progressionscovering systemsinverse theorems

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Arithmetic progressions (11B25) Sieves (11N35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of the minimum modulus problem for covering systems
• Effective bounds for certain functions concerning prime numbers
• The Erdős-Selfridge problem with square-free moduli
• On the Erdős covering problem: the density of the uncovered set
• Covering systems with restricted divisibility
• Natural exact covering systems and the reversion of the Möbius series
• On exactly covering systems of arithmetic sequences
• Roots of unity and covering sets
• On exact coverings of the integers
• A Problem of Ramanujan, Erdős, and Kátai on the Iterated Divisor Function
• Sieving by large integers and covering systems of congruences
• Regular coverings of the integers by arithmetic progressions
• A Survey of Problems in Combinatorial Number Theory
• THE MAXIMAL ORDER OF ITERATED MULTIPLICATIVE FUNCTIONS
• Reducibility of polynomials and covering systems of congruences

This page was built for publication: The structure and number of Erdős covering systems