On covering systems of polynomial rings over finite fields
Abstract
In 1950, Erdős posed a question known as the minimum modulus problem on covering systems for Z, which asked whether the minimum modulus of a covering system with distinct moduli is bounded. This long-standing problem was finally resolved by Hough in 2015, as he proved that the minimum modulus of any covering system with distinct moduli does not exceed 1016. Recently, Balister, Bollobás, Morris, Sahasrabudhe, and Tiba developed a versatile method called the distortion method and significantly reduced Hough's bound to 616,000. In this paper, we apply this method to present a proof that the smallest degree of the moduli in any covering system for Fq[x] of multiplicity s is bounded by a constant depending only on s and q. Consequently, we successfully resolve the minimum modulus problem for Fq[x] and disprove a conjecture by Azlin.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.