An algorithm to compute relative cubic fields
From MaRDI portal
Publication:5326515
DOI10.1090/S0025-5718-2013-02686-5zbMath1360.11147arXiv1103.2901OpenAlexW2038404091MaRDI QIDQ5326515
Publication date: 6 August 2013
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.2901
Kummer theoryDirichlet seriescubic fieldscomputation of discriminantsJulia reductionTaniguchi parametrization
Related Items (1)
Uses Software
Cites Work
- An inequality for the discriminant of a polynomial
- Generators and relations for certain special linear groups
- Density of discriminants of cubic extensions.
- Reduction of Binary Cubic and Quartic Forms
- A fast algorithm to compute cubic fields
- Advanced Topics in Computional Number Theory
- On the density of discriminants of cubic fields. II
- Algorithmic Number Theory
- On the distribution of Galois groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An algorithm to compute relative cubic fields