Bit-size estimates for triangular sets in positive dimension (Q657656)

Bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over \(Q\) are given. The estimates are worst case upper bounds and depend on the degree and height of the underlying algebraic sets. The use of these results is demonstrated in the context of a modular algorithm. This work extends the results confined to the case of dimension \(0\), provided by \textit{X. Dahan} and \textit{E. Schost}, in: ISSAC 2004. Proceedings of the 2004 international symposium on symbolic and algebraic computation, Santander, Spain, July 4--7, 2004. 103--110 (2004; Zbl 1134.13308)]. The proposed strategy goes back to dimension \(0\) by evaluation and interpolation techniques. Even though the main tool (height theory) remains the same, new difficulties arise to control the growth of the coefficients during the interpolation process.