Papers
Topics
Authors
Recent
Search
2000 character limit reached

On covering systems of polynomial rings over finite fields

Published 10 Aug 2023 in math.NT | (2308.05378v2)

Abstract: In 1950, Erd\H{o}s posed a question known as the minimum modulus problem on covering systems for $\mathbb{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 $10{16}$. Recently, Balister, Bollob\'as, 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 $\mathbb{F}_q[x]$ of multiplicity $s$ is bounded by a constant depending only on $s$ and $q$. Consequently, we successfully resolve the minimum modulus problem for $\mathbb{F}_q[x]$ and disprove a conjecture by Azlin.

Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.