Discriminants of simplest 3n-tic extensions

Abstract

Let >2 be a positive integer, ζ a primitive -th root of unity, and K a number field containing ζ+ζ-1 but not ζ. In a recent paper, Chonoles et. al. study iterated towers of number fields over K generated by the generalized Rikuna polynomial, rn(x,t;) ∈ K(t)[x]. They note that when K = Q, t ∈ \0,1\, and =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 Q(θ) where θ is a root of rn(x,t;3), answering the question of Chonoles et. al. in the case K = Q, =3, and t ∈ Z. In the latter half of the paper, we identify some cases where the dynamics of rn(x,t;) over finite fields yields an explicit description of the decomposition of primes in these iterated extensions.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…