Skip to main content
SpringerLink
Log in

Modular Algorithms for Computing a Generating Set of the Syzygy Module

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2009)

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

Included in the following conference series:

Abstract

We present two modular algorithms for computing a generating set of the syzygy module of a given sequence of elements in R l, where R is a polynomial ring or a Weyl algebra over Q.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, W., Loustaunau, P.: An Introduction to Gröbner Bases. Graduate Studies in Mathematics, vol. 3. AMS (1994)

    Google Scholar 

  2. Arnold, E.: Modular Algorithms for computing Gröber bases. J. Symb. Comp. 35(4), 403–419 (2003)

    Article  MATH  Google Scholar 

  3. Cox, D., Little, J., O’Shea, D.: Using Algebraic Geometry. In: GTM, vol. 185, Springer, Heidelberg (2005)

    Google Scholar 

  4. Examples in the web page of Janet Basis, http://invo.jinr.ru/examples.phtml

  5. Greuel, G.-M., Pfister, G.: A Singular Introduction to Commutative Algebra. Springer, Heidelberg (2007), http://www.singular.uni-kl.de/

    MATH  Google Scholar 

  6. Kreuzer, M., Robbiano, L.: Computational Commutative Algebra, vol. 1. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  7. La Scala, R., Stillman, M.: Strategies for computing minimal free resolutions. J. Symb. Comp. 26, 409–431 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  8. Macaulay 2 home page, http://www.math.uiuc.edu/Macaulay2/

  9. Möller, H.M., Mora, T., Traverso, C.: Gröber Bases Computation Using Syzygies. In: Proc. ISSAC 1992, pp. 320–328. ACM Press, New York (1992)

    Google Scholar 

  10. Mora, T.: Solving Polynomial Equation Systems II, Macaulay’s pradigm and Gróber Technology. In: Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (2005)

    Google Scholar 

  11. Noro, M., Yokoyama, K.: A Modular Method to Compute the Rational Univariate Representation of Zero-Dimensional Ideals. J. Symb. Comp. 28(1), 243–263 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Risa/Asir: A computer algebra system, http://www.math.kobe-u.ac.jp/Asir/asir.html

  13. Saito, M., Sturmfels, B., Takayama, N.: Gröber deformations of hypergeometric differential equations. Algorithms and Computation in Mathematics 6 (2000)

    Google Scholar 

  14. Traverso, C.: Gröber trace algorithms. In: Gianni, P. (ed.) ISSAC 1988. LNCS, vol. 358, pp. 125–138. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Graduate School of Science, Kobe University, Japan

    Masayuki Noro

Authors
  1. Masayuki Noro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Joint Institute for Nuclear Research, Laboratory of Information Technologies, Dubna, Russia

    Vladimir P. Gerdt

  2. Technische Universität München‘, Institut für Informatik, Garching, Germany

    Ernst W. Mayr

  3. Institute of Theoretical and Applied Mechanics, Russian Academy of Sciences, Novosibirsk, Russia

    Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Noro, M. (2009). Modular Algorithms for Computing a Generating Set of the Syzygy Module. In: Gerdt, V.P., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2009. Lecture Notes in Computer Science, vol 5743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04103-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04103-7_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04102-0

  • Online ISBN: 978-3-642-04103-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation