[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

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:

  • 1071 Accesses

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

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

Authors

Editor information

Editors and Affiliations

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