The discriminant of abelian number fields
Victor Bautista-Ancona, Jose Uc-Kuk
Abstract
Victor Bautista-Ancona, Jose Uc-Kuk
Abstract
For an abelian number field $K$, the discriminant can be obtained from the conductor~$m$ of~$K$, the degree of~$K$ over $\mathbb {Q}$, and the degrees of extensions $K\cdot \mathbb {Q}(\zeta _{m/p^{\alpha }})/\mathbb {Q}(\zeta _{m/p^{\alpha }})$, where $p$ runs through the set of primes that divide $m$, and $p^{\alpha }$ is the greatest power that divides~$m$. In this paper, we give a formula for computing the discriminant of any abelian number field.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For an abelian number field $K$, the discriminant can be obtained from the conductor~$m$ of~$K$, the degree of~$K$ over $\mathbb {Q}$, and the degrees of extensions $K\cdot \mathbb {Q}(\zeta _{m/p^{\alpha }})/\mathbb {Q}(\zeta _{m/p^{\alpha }})$, where $p$ runs through the set of primes that divide $m$, and $p^{\alpha }$ is the greatest power that divides~$m$. In this paper, we give a formula for computing the discriminant of any abelian number field.
Key concepts: Discriminant, Mathematics, Abelian group, Algebraic number field, Combinatorics, Field (mathematics), Conductor, Discrete mathematics