Irreducibility criterion for quasi-ordinary polynomials

2009/04/28 by Abdallah Assi, Assi, Abdallah
Computer Science · Mathematics · #32S25 #32S70 #Algebraic Geometry (math.AG) #Commutative Algebra (math.AC) #FOS: Mathematics #Polynomial and algebraic computation #math.AC #math.AG #msc:32S25 #msc:32S70

paper · pdf · doi:10.48550/arxiv.0904.4413

12 pages

arxiv created 2009/04/28 · openalex publication_date 2009/04/28 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We give a criterion for a quasi-ordinary polynomial to be irreducible. The criterion is based on the notion of approximate roots and that of generalized Newton polygons.

Related

• An irreducibility criterion for power series
• On Abhyankar's irreducibility criterion for quasi-ordinary polynomials
• Nearly irreducibility of polynomials and the Newton diagrams
• A quasi-linear irreducibility test in K[[x]][y]
• Using approximate roots for irreducibility and equi-singularity issues\n in K[[x]][y]