On the complexity of rational Puiseux expansions (Q1305098)

Here are obtained consistent results on the complexity of rational Puiseux expansions introduced by \textit{D. Duval} [Compos. Math. 70, 119-154 (1989; Zbl 0699.14034)]. Assuming \(F(x,y)\in {\mathbb Q}[x,y]\) of degree \(n\) with respect to \(y\), \(m\) with respect to \(x\), \(\text{disc}_yF\neq 0\), \(h=\text{ht}(F)\), the author proves that there exists a positive constant \(C<2500\) and a system \(S\) of rational Puiseux expansions of \(y\) with \[ \text{ht}(S) < \left(2^n mn^{\log n}h\right)^{Cm^2n^{10}}. \] The proof is based on the construction of a system of rational Puiseux expansions which can be computed in polynomial time in the bit complexity of \(F\) and on the construction of a parameter with `small' height.