Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties | SpringerLink
Skip to main content
Springer Nature Link
Log in

Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties

  • Conference paper
Computer Science – Theory and Applications (CSR 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3967))

Included in the following conference series:

  • 1001 Accesses

Abstract

We suggest a model of representation of algebraic varieties based on representative systems of points of its irreducible components. Deterministic polynomial–time algorithms to substantiate this model are described in zero–characteristic. The main result here is a construction of the intersection of algebraic varieties. As applications we get efficient algorithms for constructing the smooth stratification and smooth cover of an algebraic variety introduced by the author earlier.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chistov, A.L.: Polynomial–Time Computation of the Dimension of Algebraic Varieties in Zero–Characteristic. Journal of Symbolic Computation 22(1), 1–25 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chistov, A.L.: Polynomial–time computation of the dimensions of components of algebraic varieties in zero–characteristic. Journal of Pure and Applied Algebra 117 & 118, 145–175 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chistov, A.L.: Polynomial–time computation of the degrees of algebraic varieties in zero–characteristic and its applications. Zap. Nauchn. Semin. St-Petersburg. Otdel. Mat. Inst. Steklov (POMI) 258, 7–59 (1999) (in Russian); English transl.: Journal of Mathematical Sciences 108(6), 897–933 (2002) (Preliminary versions of [3], [4], [5] and [6] in English can be found as Preprints (1999), http://www.MathSoc.spb.ru )

  4. Chistov, A.L.: Strong version of the basic deciding algorithm for the existential theory of real fields. Zap. Nauchn. Semin. St-Petersburg. Otdel. Mat. Inst. Steklov (POMI) 256, 168–211 (1999) (in Russian); English transl.: J. of Mathematical Sciences 107(5), 4265–4295 (Preliminary versions of [3], [4], [5] and [6] in English can be found as Preprints (1999), http://www.MathSoc.spb.ru )

  5. Chistov, A.L.: Efficient Construction of Local Parameters of Irreducible Components of an Algebraic Variety. In: Proc. of the St.–Petersburg Mathematical Society, vol. 7, pp. 230–266 (1999) (in Russian); English transl. In: Proceedings of the St.Petersburg Mathematical Society, vol. VII. American Math. Soc. Publisher (2001) (Preliminary versions of [3], [4], [5] and [6] in English can be found as Preprints (1999), http://www.MathSoc.spb.ru )

  6. Chistov, A.L.: Efficient Smooth Stratification of an Algebraic Variety in Zero–Characteristic and its Applications. Zap. Nauchn. Semin. St-Petersburg. Otdel. Mat. Inst. Steklov (POMI) 266, 254–311 (2000) (in Russian); English transl.: Journal of Mathematical Sciences 113(5), 689–717 (2003) (Preliminary versions of [3], [4], [5] and [6] in English can be found as Preprints (1999), http://www.MathSoc.spb.ru )

  7. Chistov, A.L.: Monodromy and irreducibility criteria with algorithmic applications in zero–characteristic. Zap. Nauchn. Semin. St-Petersburg. Otdel. Mat. Inst. Steklov (POMI) 292, 130–152 (2002) (in Russian); see Preprint of St.Petersburg Mathematical Society (2004) (in English)

    Google Scholar 

  8. Chistov, A.L.: Polynomial–time computation of the degree of a dominant morphism in zero–characteristic I. Zap. Nauchn. Semin. St-Petersburg. Otdel. Mat. Inst. Steklov (POMI) 307, 189–235 (2004) (in Russian); see Preprint of St.Petersburg Mathematical Society (2004) (in English)

    Google Scholar 

  9. Chistov, A.L.: Polynomial–time computation of the degree of a dominant morphism in zero–characteristic II, Preprint of St.Petersburg Mathematical Society (2004), http://www.MathSoc.spb.ru

  10. Chistov, A.L.: A deterministic polynomial–time algorithm for the first Bertini theorem, Preprint of St.Petersburg Mathematical Society (2004), http://www.MathSoc.spb.ru

  11. Chistov, A.L.: A correction in the statement of my theorem on the efficient smooth cover and smooth stratification of an algebraic variety. Preprint of the St.–Petersburg Mathematical Society, 13 (2004), http://www.mathsoc.spb.ru/preprint/2004/index.html

Download references

Author information

Authors and Affiliations

  1. St. Petersburg Department of Steklov Mathematical Institute, Fontanka 27, St. Petersburg, 191011, Russia

    Alexander L. Chistov

Authors
  1. Alexander L. Chistov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRMAR, Université de Rennes, Campus de Beaulieu, 35042, Rennes Cedex, France

    Dima Grigoriev

  2. Intel Corporation, JF1-13, 2111 NE 25th Avenue, 97124, Hillsboro, OR, USA

    John Harrison

  3. Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, St., 191023, Petersburg, Russia

    Edward A. Hirsch

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chistov, A.L. (2006). Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds) Computer Science – Theory and Applications. CSR 2006. Lecture Notes in Computer Science, vol 3967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753728_16

Download citation

  • DOI: https://doi.org/10.1007/11753728_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34166-6

  • Online ISBN: 978-3-540-34168-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation