English

On modular computation of Groebner bases with integer coefficients

Commutative Algebra 2024-12-04 v1 Symbolic Computation

Abstract

Let I1I2I_1\subset I_2\subset\dots be an increasing sequence of ideals of the ring Z[X]\Bbb Z[X], X=(x1,,xn)X=(x_1,\dots,x_n) and let II be their union. We propose an algorithm to compute the Gr\"obner base of II under the assumption that the Gr\"obner bases of the ideal QI\Bbb Q I of the ring Q[X]\Bbb Q[X] and the the ideals I(Z/mZ)I\otimes(\Bbb Z/m\Bbb Z) of the rings (Z/mZ)[X](\Bbb Z/m\Bbb Z)[X] are known. Such an algorithmic problem arises, for example, in the construction of Markov and semi-Markov traces on cubic Hecke algebras.

Keywords

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

R2 v1 2026-06-22T02:33:30.837Z