On computing absolutely irreducible components of algebraic varieties with parameters (Q5962004)
From MaRDI portal
scientific article; zbMATH DE number 5786369
Language | Label | Description | Also known as |
---|---|---|---|
English | On computing absolutely irreducible components of algebraic varieties with parameters |
scientific article; zbMATH DE number 5786369 |
Statements
On computing absolutely irreducible components of algebraic varieties with parameters (English)
0 references
16 September 2010
0 references
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\).
0 references
parametric polynomials
0 references
irreducible components
0 references
polynomial factorization
0 references
algebraic varieties depending on parameters
0 references