Covering systems with odd moduli
Joshua Harrington, Yewen Sun, Wing Hong Tony Wong

TL;DR
This paper investigates a variation of the odd covering problem, allowing repeated odd prime moduli and considering square-free moduli, advancing understanding of covering systems with specific restrictions.
Contribution
It introduces a new variation of the odd covering problem permitting repeated odd prime moduli and explores the case with square-free moduli.
Findings
Analyzed the existence of covering systems with repeated odd prime moduli.
Explored the impact of square-free restrictions on covering systems.
Provided new insights into the structure of covering systems with odd moduli.
Abstract
The concept of a covering system was first introduced by Erd\H{o}s in 1950. Since their introduction, a lot of the research regarding covering systems has focused on the existence of covering systems with certain restrictions on the moduli. Arguably, the most famous open question regarding covering systems is the odd covering problem. In this paper, we explore a variation of the odd covering problem, allowing a single odd prime to appear as a modulus in the covering more than once, while all other moduli are distinct, odd, and greater than . We also consider this variation while further requiring the moduli of the covering system to be square-free.
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
Topicssemigroups and automata theory · Limits and Structures in Graph Theory · Polynomial and algebraic computation
