Bounds for Erdős covering systems in global function fields
Abstract
Covering systems of the integers were introduced by Erdős in 1950. Since then, many beautiful questions and conjectures about these objects have been posed. Most famously, Erdős asked whether the minimum modulus of a covering system with distinct moduli is arbitrarily large. This problem was resolved in 2015 by Hough, who proved that the minimum modulus is bounded. In 2022, Balister et al. developed Hough's method and gave a simpler but more versatile proof of Hough's result. Their technique has many applications in a number of variants on Erdős' minimum modulus problem. In this paper, we show that there is no covering system of multiplicity s in any global function field of genus g over Fq for q≥(82.26+18.88g)e0.95gs2. Moreover, we obtain that there is no covering system of Fq[x] with distinct moduli for q>73. This improves the results in the previous work of the author joint with Li, Wang and Yi.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.