Algorithmic search for integer abelian roots of a polynomial with integer abelian coefficients

DOI10.18500/1816-9791-2024-24-2-193-199zbMATH Open1543.65068MaRDI QIDQ6571107FDOQ6571107

Authors: Liliya Mikhaĭlovna Tsybulya 

Publication date: 11 July 2024

Published in: Izvestiya Saratovskogo Universiteta. Novaya Seriya. Seriya Matematika, Mekhanika, Informatika (Search for Journal in Brave)

Recommendations

• Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
• Abelian lifts of polynomials
• Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
• Computing automorphisms of abelian number fields
• A method for deciding whether the Galois group is abelian

zbMATH Keywords

algorithmpolynomial rootabelian number

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Cites Work

• Problems in Algebraic Number Theory
• Title not available (Why is that?)
• An Elementary Proof of the Kronecker-Weber Theorem
• On the torsion in the general linear group and the diagonalization algorithm

This page was built for publication: Algorithmic search for integer abelian roots of a polynomial with integer abelian coefficients

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