Abstract

In this paper, we propose a semi-numerical algorithm for computing all irreducible branches of a curve in C3 defined by polynomials with rational coefficients. It is based on some properties appearing after a generic change of coordinate. Using numerical computation, Galois group action and rational approximation, it provides an efficient probabilistic algorithm for medium degrees. Our method generalizes our study on absolute factorization of polynomials ([2, 6]).

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.