An upper bound for the minimum modulus in a covering system with squarefree moduli
Maria Cummings, Michael Filaseta, Ognian Trifonov

TL;DR
This paper establishes an upper bound of 118 for the smallest modulus in covering systems with distinct squarefree moduli, and shows the k-th smallest modulus is bounded by an absolute constant.
Contribution
It provides the first explicit upper bound for the minimum modulus in such covering systems with squarefree moduli.
Findings
Minimum modulus in covering systems with squarefree moduli is at most 118.
The k-th smallest modulus in any covering system with distinct moduli is bounded by an absolute constant.
The results extend previous work by providing explicit bounds.
Abstract
Based on work of P. Balister, B. Bollob\'as, R. Morris, J. Sahasrabudhe and M. Tiba, we show that if a covering system has distinct squarefree moduli, then the minimum modulus is at most 118. We also show that in general the smallest modulus in a covering system with distinct moduli (provided it is required for the covering) is bounded by an absolute constant.
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
TopicsRings, Modules, and Algebras · Analytic Number Theory Research · Finite Group Theory Research
