Reducing number field defining polynomials: an application to class group computations

DOI10.1112/S1461157016000255zbMATH Open1391.11163MaRDI QIDQ2971018FDOQ2971018

Authors: Alexandre Gélin, Antoine Joux 

Publication date: 4 April 2017

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Recommendations

• Publication:3470563
• scientific article; zbMATH DE number 4200333
• scientific article; zbMATH DE number 1186973
• scientific article; zbMATH DE number 1302464
• Computing ray class groups, conductors and discriminants

Mathematics Subject Classification ID

Other number fields (11R21) Class numbers, class groups, discriminants (11R29) Algebraic number theory computations (11Y40)

Cites Work

• Factorization of certain cyclotomic functions
• An inequality for the discriminant of a polynomial
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection
• A polynomial reduction algorithm
• Topics in computational algebraic number theory
• Landau's inequality via Hadamard's
• Subexponential class group and unit group computation in large degree number fields

Cited In (2)

• On computing subfields. A detailed description of the algorithm
• Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares

This page was built for publication: Reducing number field defining polynomials: an application to class group computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971018)