Skip to main content
Log in

An Effective Construction of a Small Number of Equations Defining an Algebraic Variety

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Consider a system of polynomial equations in n variables of degrees at most d with the set of all common zeros V. We suggest subexponential time algorithms (in the general case and in the case of zero characteristic) for constructing n+1 equations of degrees at most d defining the algebraic variety V.

Further, we construct n equations defining V. We give an explicit upper bound on the degrees of these n equations. It is double exponential in n. The running time of the algorithm for constructing them is also double exponential in n.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. L. Chistov, “Polynomial complexity algorithm for factoring polynomials and constructing components of a variety in subexponential time,” Zap. Nauchn. Semin. POMI, 137, 124–188 (1984).

    MATH  Google Scholar 

  2. A. L. Chistov, “An improvement of the complexity bound for solving systems of polynomial equations,” Zap. Nauchn. Semin. POMI, 390, 299–306 (2011).

    MathSciNet  Google Scholar 

  3. 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).

    Google Scholar 

  4. 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).

    MATH  Google Scholar 

  5. A. L. Chistov, “Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero),” Zap. Nauchn. Semin. POMI, 378, 133–170 (2010).

    Google Scholar 

  6. A. L. Chistov, “Efficient absolute factorization of polynomials with parametric coefficients,” Zap. Nauchn. Semin. POMI, 448, 286–325 (2016).

    MathSciNet  Google Scholar 

  7. G. E. Collins, “Polynomial remainder sequences and determinants,” Amer. Math. Monthly, 73, No. 7, 708–712 (1966).

    Article  MathSciNet  Google Scholar 

  8. L. Kronecker, “Grundzüge einer arithmetischen Theorie der algebraischen Grössen,” J. reine angew. Math., 92, 1–123 (1882).

    MathSciNet  MATH  Google Scholar 

  9. U. Storch, “Bemerkung zu einem Satz von M. Kneser,” Arch. Math., 23, 403–404 (1972).

    Article  MathSciNet  Google Scholar 

  10. D. Eisenbud and E. G. Evans, Jr, “Every algebraic set in n-space is the intersection of n hypersurfaces,” Inv. Math., 19, 107–112 (1973).

    Article  MathSciNet  Google Scholar 

  11. E. Kunz, Introduction to Commutative Algebra and Algebraic Geometry, Birkhäuser (1985).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. L. Chistov.

Additional information

Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 507, 2021, pp. 140–156.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chistov, A.L. An Effective Construction of a Small Number of Equations Defining an Algebraic Variety. J Math Sci 261, 687–697 (2022). https://doi.org/10.1007/s10958-022-05780-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-022-05780-5

Navigation