Abstract

We provide an irreducibility test in the ring $$\mathbb{K}[[x]][y]$$ whose complexity is quasi-linear with respect to the discriminant valuation, assuming the input polynomial $$F$$ is square-free and $$\mathbb{K}$$ is a perfect field of characteristic not dividing $$\deg(F)$$ . The algorithm uses the theory of approximate roots and may be seen as a generalisation of Abhyankar's irreducibility criterion to the case of non-algebraically closed residue fields.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.