Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Erdős covering systems in global function fields

Published 6 Feb 2024 in math.NT | (2402.03810v2)

Abstract: A covering system of the integers is a finite collection of arithmetic progressions whose union is the set of integers. A well-known problem on covering systems is the minimum modulus problem posed by Erd\H{o}s in 1950, who asked whether the minimum modulus in such systems with distinct moduli can be arbitrarily large. This problem was resolved by Hough in 2015, who showed that the minimum modulus is at most $10{16}$. In 2022, Balister, Bollob\'as, Morris, Sahasrabudhe and Tiba reduced Hough's bound to $616,000$ by developing Hough's method. They call it the distortion method. In this paper, by applying this method, we mainly prove that there does not exist any covering system of multiplicity $s$ in any global function field of genus $g$ over $\mathbb{F}_q$ for $q\geq (1.14+0.16g)e{6.5+0.97g}s2$. In particular, there is no covering system of $\mathbb{F}_q[x]$ with distinct moduli for $q\geq 759$.

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.