On modular computation of Groebner bases with integer coefficients
Commutative Algebra
2024-12-04 v1 Symbolic Computation
Abstract
Let be an increasing sequence of ideals of the ring , and let be their union. We propose an algorithm to compute the Gr\"obner base of under the assumption that the Gr\"obner bases of the ideal of the ring and the the ideals of the rings are known. Such an algorithmic problem arises, for example, in the construction of Markov and semi-Markov traces on cubic Hecke algebras.
Cite
@article{arxiv.1312.6331,
title = {On modular computation of Groebner bases with integer coefficients},
author = {S. Yu. Orevkov},
journal= {arXiv preprint arXiv:1312.6331},
year = {2024}
}
Comments
3 pages