Using approximate roots for irreducibility and equi-singularity issues in K[[x]][y]

MaRDI QIDQ6316448zbMATH OpenFDO

Authors Adrien Poteaux, Martin Weimann

Publication date 30 March 2019

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Symbolic computation and algebraic computation (68W30)

Abstract: We provide an irreducibility test in the ring Kx[y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater than deg(F). The algorithm uses the theory of approximate roots and may be seen as a generalization of Abhyankhar's irreducibility criterion to the case of non algebraically closed residue fields. More generally, we show that we can test within the same complexity if a polynomial is pseudo-irreducible, a larger class of polynomials containing irreducible ones. If $F$ is pseudo-irreducible, the algorithm computes also the valuation of the discriminant and the equisingularity types of the germs of plane curve defined by F along the fiber x=0.

This page was built for publication: Using approximate roots for irreducibility and equi-singularity issues in Kx[y]

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