Pith. sign in

REVIEW

On modular computation of Groebner bases with integer coefficients

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1312.6331 v1 pith:WEUN7JFS submitted 2013-12-22 math.AC cs.SC

classification math.ACcs.SC
keywords basesdotsidealsobnerringsubsetalgebrasalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ 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 $\Bbb Q I$ of the ring $\Bbb Q[X]$ and the the ideals $I\otimes(\Bbb Z/m\Bbb Z)$ of the rings $(\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.

Discussion (0). Continue with ORCID to comment.

Pith tools