Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sieves and the Minimal Ramification Problem

Published 11 Feb 2016 in math.NT | (1602.03662v1)

Abstract: The minimal ramification problem may be considered as a quantitative version of the inverse Galois problem. For a nontrivial finite group $G$, let $m(G)$ be the minimal integer $m$ for which there exists a Galois extension $N/\mathbb{Q}$ that is ramified at exactly $m$ primes (including the infinite one). So, the problem is to compute or to bound $m(G)$. In this paper, we bound the ramification of extensions $N/\mathbb{Q}$ obtained as a specialization of a branched covering $\phi\colon C\to \mathbb{P}1_{\mathbb{Q}}$. This leads to novel upper bounds on $m(G)$, for finite groups $G$ that are realizable as the Galois group of a branched covering. Some instances of our general results are: $$ 1\leq m(S_m)\leq 4 \quad \mbox{and} \quad n\leq m(S_mn) \leq n+4, $$ for all $n,m>0$. Here $S_m$ denotes the symmetric group on $m$ letters, and $S_mn$ is the direct product of $n$ copies of $S_m$. We also get the correct asymptotic of $m(Gn)$, as $n \to \infty$ for a certain class of groups $G$. Our methods are based on sieve theory results, in particular on the Green-Tao-Ziegler theorem on prime values of linear forms in two variables, on the theory of specialization in arithmetic geometry, and on finite group theory.

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.