2019
DOI: 10.48550/arxiv.1911.03551
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A quasi-linear irreducibility test in K[[x]][y]

Abstract: We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the discriminant valuation, 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 generalisation of Abhyankhar's irreducibility criterion to the case of non algebraically closed residue fields.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 15 publications
(21 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?