arXiv Analytics

Sign in

arXiv:1409.7829 [math.NT]AbstractReferencesReviewsResources

Discriminants of simplest 3^n-tic extensions

T. Alden Gassert

Published 2014-09-27Version 1

Let $\ell>2$ be a positive integer, $\zeta_\ell$ a primitive $\ell$-th root of unity, and $K$ a number field containing $\zeta_\ell+\zeta_\ell^{-1}$ but not $\zeta_\ell$. In a recent paper, Chonoles et. al. study iterated towers of number fields over $K$ generated by the generalized Rikuna polynomial, $r_n(x,t;\ell) \in K(t)[x]$. They note that when $K = \mathbb{Q}$, $t \in \{0,1\}$, and $\ell=3$, the only ramified prime in the resulting tower is 3, and they ask under what conditions is the number of ramified primes small. In this paper, we apply a theorem of Gu\`ardia, Montes, and Nart to derive a formula for the discriminant of $\mathbb{Q}(\theta)$ where $\theta$ is a root of $r_n(x,t;3)$, answering the question of Chonoles et. al. in the case $K = \mathbb{Q}$, $\ell=3$, and $t \in \mathbb{Z}$. In the latter half of the paper, we identify some cases where the dynamics of $r_n(x,t;\ell)$ over finite fields yields an explicit description of the decomposition of primes in these iterated extensions.

Related articles: Most relevant | Search more
arXiv:1910.11556 [math.NT] (Published 2019-10-25)
Discriminants of number fields and surjectivty of trace homomorphism on rings of integers
arXiv:math/9612229 [math.NT] (Published 1996-12-17)
Small generators of number fields
arXiv:math/0411484 [math.NT] (Published 2004-11-22, updated 2005-07-27)
The number of $S_4$ fields with given discriminant