Finiteness of Disjoint Covering Systems with Precisely One Repeated Modulus
Yu Hashimoto

TL;DR
This paper proves that for each fixed number of repetitions, only finitely many disjoint covering systems with a minimum modulus of at least 3 exist where only the largest modulus is repeated exactly m times.
Contribution
It establishes the finiteness of such covering systems for each fixed repetition count, advancing understanding of their structural limitations.
Findings
Finitely many such systems exist for each fixed m ≥ 2.
The largest modulus is the only repeated one in these systems.
Minimum modulus in these systems is at least 3.
Abstract
We prove that for each fixed , there are only finitely many disjoint covering systems with minimum modulus at least in which precisely one modulus is repeated, namely the largest modulus, and it occurs exactly times.
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.
