Irreducibility criterion for quasi-ordinary polynomials
Abdallah Assi

TL;DR
This paper introduces a new criterion for determining the irreducibility of quasi-ordinary polynomials using approximate roots and generalized Newton polygons.
Contribution
It provides a novel irreducibility criterion specifically for quasi-ordinary polynomials, enhancing existing algebraic tools.
Findings
New irreducibility criterion based on approximate roots
Utilizes generalized Newton polygons for analysis
Applicable to a broad class of quasi-ordinary polynomials
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation
