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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adams, W., Loustaunau, P.: An Introduction to Gröbner Bases. Graduate Studies in Mathematics, vol. 3. AMS (1994)
Arnold, E.: Modular Algorithms for computing Gröber bases. J. Symb. Comp. 35(4), 403–419 (2003)
Cox, D., Little, J., O’Shea, D.: Using Algebraic Geometry. In: GTM, vol. 185, Springer, Heidelberg (2005)
Examples in the web page of Janet Basis, http://invo.jinr.ru/examples.phtml
Greuel, G.-M., Pfister, G.: A Singular Introduction to Commutative Algebra. Springer, Heidelberg (2007), http://www.singular.uni-kl.de/
Kreuzer, M., Robbiano, L.: Computational Commutative Algebra, vol. 1. Springer, Heidelberg (2008)
La Scala, R., Stillman, M.: Strategies for computing minimal free resolutions. J. Symb. Comp. 26, 409–431 (1998)
Macaulay 2 home page, http://www.math.uiuc.edu/Macaulay2/
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)
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)
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)
Risa/Asir: A computer algebra system, http://www.math.kobe-u.ac.jp/Asir/asir.html
Saito, M., Sturmfels, B., Takayama, N.: Gröber deformations of hypergeometric differential equations. Algorithms and Computation in Mathematics 6 (2000)
Traverso, C.: Gröber trace algorithms. In: Gianni, P. (ed.) ISSAC 1988. LNCS, vol. 358, pp. 125–138. Springer, Heidelberg (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)