Polynomial factorization over henselian fields - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Foundations of Computational Mathematics Année : 2023

Polynomial factorization over henselian fields

Résumé

Given a valued field $(K,v)$ and an irreducible polynomial $g\in K[x]$, we survey the ideas of Ore, Maclane, Okutsu, Montes, Vaqui\'e and Herrera-Olalla-Mahboub-Spivakovsky, leading (under certain conditions) to an algorithm to find the factorization of $g$ over a henselization of $(K,v)$.

Dates et versions

hal-03962819 , version 1 (30-01-2023)

Licence

Paternité

Identifiants

Citer

Maria Alberich-Carramiñana, Jordi Guàrdia, Enric Nart, Joaquim Roé, Martin Weimann, et al.. Polynomial factorization over henselian fields. Foundations of Computational Mathematics, In press. ⟨hal-03962819⟩
31 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More