Consider a system of polynomial equations with parametric coefficients over an arbitrary ground field. We show that the variety of parameters can be represented as a union of strata. For values of parameters from each stratum, the solutions of the system are given by algebraic formulas depending only on this stratum. Each stratum is a quasiprojective algebraic variety with degree bounded from above by a subexponential function in the size of the input data. Also, the number of strata is subexponential in the size of the input data. Thus, we avoid double exponential upper bounds on the degrees and solve a long-standing problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Ayad, “Complexity of solving parametric polynomial systems,” Zap. Nauchn. Semin. POMI, 387, 5–52 (2011).
A. L. Chistov, “A polynomial-complexity algorithm for factoring polynomials and constructing components of a variety in subexponential time,” Zap. Nauchn. Semin. LOMI, 137, 124–188 (1984).
A. L. Chistov, “An improvement of the complexity bound for solving systems of polynomial equations”, Zap. Nauchn. Semin. POMI, 390, 299–306 (2011).
A. L. Chistov, “Estimation of the degree of a system of equations that determines a variety of reducible polynomials,” Algebra Analiz, 24, No. 3, 199–222 (2012); and “Correction...”, Algebra Analiz, 25, No. 2, 279 (2013).
A. L. Chistov, “Computations with parameters: a theoretical background”, Zap. Nauchn. Semin. POMI, 436, 219–239 (2015).
A. L. Chistov, “Efficient absolute factorization of polynomials with parametric coefficients,” Zap. Nauchn. Semin. POMI, 448, 286–325 (2016).
A. L. Chistov, “Efficient algorithms for factoring polynomials and their applications,” Doctor of Sciences Thesis, Leningrad (1987).
A. L. Chistov, “Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I,” Zap. Nauchn. Semin. POMI, 462, 122–166 (2017).
A. L. Chistov, “Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. II,” Zap. Nauchn. Semin. POMI, 468, 138–176 (2018).
A. Chistov, H. Fournier, L. Gurvits, and P. Koiran, “Vandermonde matrices, NPcompleteness, and transversal subspaces,” Found. Comput. Math., 3, No. 4, 421–427 (2003).
D. Lazard and F. Rouillier, “Solving parametric polynomial systems,” J. Symbolic Comput., 42, No. 6, 636–667 (2007).
D. Lazard, “Résolution des systémes d’équations algébriques,” Theoret. Comput. Sci., 15, 77–110 (1981).
D. Lazard, “Commutative algebra and computer algebra,” Lect. Notes Comput. Sci., 144, 40–48 (1983).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 481, 2019, pp. 146–177.
Translated by A. L. Chistov.
Rights and permissions
About this article
Cite this article
Chistov, A.L. Systems with Parameters, or Efficiently Solving Systems of Polynomial Equations: 33 Years Later. III. J Math Sci 247, 738–757 (2020). https://doi.org/10.1007/s10958-020-04836-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-020-04836-8