Closed form Laurent-Puiseux series of algebraic functions (Q1908899): Difference between revisions

Let \(y\) be an algebraic function defined by a polynomial equation \(P(x, y)= 0\) whose coefficients are polynomials in \(x\) over a field \(K\) which may be one of the fields \(\mathbb{Q}\), \(\mathbb{R}\) or \(\mathbb{C}\). \textit{D. V.} and \textit{G. V. Chudnovsky} [J. Complexity 2, 271-294 (1986; Zbl 0629.68038); ibid. 3, 1-25 (1987; Zbl 0656.34003)] describe a pair of algorithms to calculate the coefficients in the Laurent-Puiseux developments of the branches of \(y\): The first algorithm returns a linear differential equation \[ q_n(x) y^{(n)}+ y_{n- 1} (x) y^{(n- 1)}+\cdots + q_1(x) y'+ q_0(x) y= 0 \] which is satisfied by all branches of \(y\) and whose coefficients are polynomials in \(x\) over \(K\), the other uses this differential equation to get a linear recurrence relation for the Puiseux coefficients. The author used this algorithms (the second in a simpler version) to calculate the recurrence relation; if this relation contains only two terms, an algorithm found by the author returns an explicit formula for the Puiseux coefficients [J. Symb. Comp. 13, 581-603 (1992; Zbl 0758.30026)]. In this paper, the author gives examples to illustrate his algorithms and to show that for many algebraic functions defined by polynomials of low degree a closed form of their Puiseux coefficients may be calculated. He points out that on the other side the complexity of the resulting recurrence equation may be extremely high even for an algebraic function defined by a sparse polynomial of low degree.