On computing absolutely irreducible components of algebraic varieties with parameters (Q5962004): Difference between revisions

The paper presents a new algorithm (together with its complexity analysis) for computing absolutely irreducible components of \(n\)-dimensional algebraic varieties defined implicitly by parametric homogeneous polynomial equations over the field of rational numbers. The algorithm computes a finite partition of the parameters space into constructible sets such that the absolutely irreducible components are given uniformly in each constructible set. In particular, the number of absolutely irreducible components is constant in each constructible set. The complexity of the algorithm is double exponential in the degree of the input parametric polynomials \(d\) and the number of variables \(n\).