Skip to main content
Log in

Polynomial-time computation of the degree of a dominant morphism in zero characteristic. III

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

Abstract

Consider a projective algebraic variety W that is an irreducible component of the set of all common zeros of a family of homogeneous polynomials of degrees less than d in n + 1 variables in zero characteristic. Consider a dominant rational morphism from W to W′ given by homogeneous polynomials of degree d′. We suggest algorithms for constructing objects in general position related to this morphism. These algorithms are deterministic and polynomial in (dd′)n and the size of the input. Bibliography: 13 titles.

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. J. Bochnak, M. Coste, and M.-F. Roy, Géométrie Algébrique Réelle, Springer-Verlag, Berlin-Heidelberg-New York (1987).

    MATH  Google Scholar 

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

    MathSciNet  Google Scholar 

  3. A. L. Chistov, “Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic,” J. Pure Appl. Algebra, 117 & 118, 145–175 (1997).

    Article  MathSciNet  Google Scholar 

  4. A. L. Chistov, “Polynomial-time computation of the degrees of algebraic varieties over a field of characteristic zero and its applications,” Zap. Nauchn. Semin. POMI, 258, 7–59 (1999).

    Google Scholar 

  5. A. L. Chistov, “Strong version of the basic deciding algorithm for the first-order existential theory of real-closed fields,” Zap. Nauchn. Semin. POMI, 256, 168–211 (1999).

    Google Scholar 

  6. A. L. Chistov, “Efficient construction of local parameters of irreducible components of an algebraic variety,” Tr. St.-Peterbg. Mat. Obshch., 7, 230–266 (1999).

    MathSciNet  Google Scholar 

  7. A. L. Chistov, “Efficient smooth stratification of an algebraic variety of characteristic zero and its applications,” Zap. Nauchn. Semin. POMI, 266, 254–311 (2000).

    Google Scholar 

  8. A. L. Chistov, “Monodromy and irreducibility criteria with algorithmic applications in characteristic zero,” Zap. Nauchn. Semin. POMI, 292, 130–152 (2002).

    Google Scholar 

  9. A. L. Chistov, “Polynomial-time computation of the degree of a dominant morphism in characteristic zero. I,” Zap. Nauchn. Semin. POMI, 307, 189–235 (2004).

    Google Scholar 

  10. A. L. Chistov, “Polynomial-time computation of the degree of a dominant morphism in characteristic zero. II,” Zap. Nauchn. Semin. POMI, 325, 181–224 (2005).

    MATH  Google Scholar 

  11. R. Hartshorne, Algebraic Geometry, Springer-Verlag, New York-Heidelberg-Berlin (1977).

    MATH  Google Scholar 

  12. W. V. D. Hodge and D. Pedoe, Methods of Algebraic Geometry, Vol. 1, Cambridge Univ. Press, Cambridge (1947).

    Google Scholar 

  13. D. Mumford, Algebraic Geometry. I. Complex Projective Varieties, Springer-Verlag, Berlin-Heidelberg-New York (1976).

    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. 344, 2007, pp. 203–239.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chistov, A.L. Polynomial-time computation of the degree of a dominant morphism in zero characteristic. III. J Math Sci 147, 7234–7250 (2007). https://doi.org/10.1007/s10958-007-0540-4

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-007-0540-4

Keywords

Navigation