Let I1 ⊂ I2 ⊂ . . . be an increasing sequence of ideals of the ring Z[X], X = (x1, . . . , xn), and let I be their union. We propose an algorithm to compute the Gr¨obner base of I under the assumption that the Gr¨obner bases of the ideal QI of the ring Q[X] and of the ideals I ⊗ (Z/mZ) of the rings (Z/mZ)[X] are known. Such an algorithmic problem arises, for example, in the construction of Markov and semi-Markov traces on cubic Hecke algebras.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. W. Adams and P. Loustaunau, An Introduction to Gröbner Bases, Amer. Math. Soc., Providence, Rhode Island (1994).
E. A. Arnold, “Modular algorithms for computing Gröbner bases,” J. Symbolic Comput., 35, 403–419 (2003).
M. Aschenbrenner, “Algorithms for computing saturations of ideals in finitely generated commutative rings,” appendix to: B. Poonen, “Automorphisms mapping a point into a subvariety,” J. Algebraic Geom., 20, 785–794 (2011).
V. Idrees, G. Pfister, and S. Steidel, “Parallelization of modular algorithms,” J. Symbolic Comput., 46, 672–684 (2011).
S. Yu. Orevkov, “Markov trace on the Funar algebra,” arXiv:1206.0765.
S. Yu. Orevkov, “Cubic Hecke algebras and invariants of transversal links,” Doklady Math., 454, No. 6, 537–541 (2014).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 421, 2014, pp. 133–137.
Rights and permissions
About this article
Cite this article
Orevkov, S.Y. On the Modular Computation of Gröbner Bases with Integer Coefficients. J Math Sci 200, 722–724 (2014). https://doi.org/10.1007/s10958-014-1964-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-014-1964-2