scientific article; zbMATH DE number 1303540

Authors

Publication date 2 August 1999

algebraic set decomposition algebraic sets effective Hilbert's irreducibility theorem multivariate polynomials polynomial ideals probabilistic algorithms

Mathematics Subject Classification ID

Hilbertian fields; Hilbert's irreducibility theorem (12E25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

Review text

\textit{E. Kaltofen}'s effective probabilistic version of the Hilbert irreducibility theorem concerning the reduction of a single multivariate polynomial to a bivariate polynomial [J. Comput. Syst. Sci. 50, 274-295 (1995; Zbl 0844.12006)] is extended to the case of the reduction of an algebraic set, defined by a system of multivariate polynomials. The authors prove this extension by applying Kaltofen's mentioned result to their decomposition algorithm for the determination of the irreducible components of an algebraic set [Solving systems of polynomial congruences modulo a large prime, Proc. Symp. Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 115-124 (1996)]. Then, they use their result to give probabilistic algorithms for the solution of several geometric problems related to algebraic sets (finding the dimension of a set, counting the number of its components, checking radical ideal membership, and others). For the entire collection see [Zbl 0904.00049].

Recommendations

Cited in

(2)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250164)