3,069 research outputs found
The structure and number of Erd\H{o}s covering systems
Introduced by Erd\H{o}s in 1950, a covering system of the integers is a
finite collection of arithmetic progressions whose union is the set
. Many beautiful questions and conjectures about covering systems
have been posed over the past several decades, but until recently little was
known about their properties. Most famously, the so-called minimum modulus
problem of Erd\H{o}s was resolved in 2015 by Hough, who proved that in every
covering system with distinct moduli, the minimum modulus is at most .
In this paper we answer another question of Erd\H{o}s, asked in 1952, on the
number of minimal covering systems. More precisely, we show that the number of
minimal covering systems with exactly elements is as , where En route to this counting result, we obtain a
structural description of all covering systems that are close to optimal in an
appropriate sense.Comment: 31 page
Proving Quadratic Reciprocity: Explanation, Disagreement, Transparency and Depth
Gauss’s quadratic reciprocity theorem is among the most important results in the history of number theory. It’s also among the most mysterious: since its discovery in the late 18th century, mathematicians have regarded reciprocity as a deeply surprising fact in need of explanation. Intriguingly, though, there’s little agreement on how the theorem is best explained. Two quite different kinds of proof are most often praised as explanatory: an elementary argument that gives the theorem an intuitive geometric interpretation, due to Gauss and Eisenstein, and a sophisticated proof using algebraic number theory, due to Hilbert. Philosophers have yet to look carefully at such explanatory disagreements in mathematics. I do so here. According to the view I defend, there are two important explanatory virtues—depth and transparency—which different proofs (and other potential explanations) possess to different degrees. Although not mutually exclusive in principle, the packages of features associated with the two stand in some tension with one another, so that very deep explanations are rarely transparent, and vice versa. After developing the theory of depth and transparency and applying it to the case of quadratic reciprocity, I draw some morals about the nature of mathematical explanation
- …