On Computing the Discriminant of an Algebraic Number Field
From MaRDI portal
Recommendations
- Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
- scientific article; zbMATH DE number 4137898
- scientific article; zbMATH DE number 4200323
- On prime divisors of the index of an algebraic integer
- Newton polygons of higher order in algebraic number theory
Cited in
(10)- On computing discriminants of subfields of \(\mathbb Q(\zeta_{p^r})\)
- Dedekind's criterion for the monogenicity of a number field versus Uchida's and Lüneburg's
- scientific article; zbMATH DE number 4214144 (Why is no real title available?)
- scientific article; zbMATH DE number 3957238 (Why is no real title available?)
- A new computational approach to ideal theory in number fields
- Power roots of polynomials over arbitrary fields
- On the Possible Forms of Discriminants of Algebraic Fields I
- An elementary computer assisted unique factorization test
- Local computation of differents and discriminants
- Equality of Polynomial and Field Discriminants
This page was built for publication: On Computing the Discriminant of an Algebraic Number Field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703968)
