Papers
Topics
Authors
Recent
Search
2000 character limit reached

Upper bound on the number of ramified primes for odd order solvable groups

Published 13 Nov 2016 in math.NT and math.GR | (1611.04103v1)

Abstract: Let $G$ be a finite group and let $ram{t}(G)$ denote the minimal positive integer $n$ such that $G$ can be realized as the Galois group of a tamely ramified extension of $\mathbb{Q}$ ramified only at $n$ finite primes. Let $d(G)$ denote the minimal non negative integer for which there exists a subset $X$ of $G$ with $d(G)$ elements such that the normal subgroup of $G$ generated by $X$ is all of $G$. It is known that $d(G)\leq ram{t}(G)$. However, it is unknown whether or not every finite group $G$ can be realized as a Galois group of a tamely ramified extension of $\mathbb{Q}$ with exactly $d(G)$ ramified primes. We will show that $3\cdot log(|G|)$ is an upper bound for $ram{t}(G)$ for all odd order solvable group $G$.

Summary

Paper to Video (Beta)

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.

Authors (1)

Collections

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