Modular techniques for noncommutative Gröbner bases (Q2183734)

Let \(K\) be a field and \(K\langle x\rangle\) the free associative \(K\)-algebra generated by \(x=(x_1,\ldots,x_n)\). A \(G\)-algebra over \(K\) is a factor algebra of type \[ A=K\langle x_1,\ldots,x_n\mid x_jx_i=c_{ij}x_ix_j+d_{ij}, 1\leq i<j\leq n\rangle \] where \(c_{ij}\in K\) and \(d_{ij}\) standard polynomials (i.e., polynomials with monomials of type \(x_1^{\alpha_1}\cdot\ldots\cdot x_n^{\alpha_n}\)) and the following hold: \begin{itemize} \item[(1)] There exists a monomial ordering \(>\) on \((x_1,\ldots,x_n)\) such that \(d_{ij}=0\) or \(x_ix_j> \text{leading monomial}(d_{ij}).\) \item[(2)] \(c_{ik}c_{jk}d_{ij}x_k-x_kd_{ij}+c_{jk}x_jd_{ik}-c_{ij}d_{ik}x_j+d_{jk}x_i-c_{ij}c_{ik}x_id_{jk}\) \end{itemize} reduce to zero with respect to the relations in \(A\). For \(G\)-algebras the theory of Gröbner bases is similar to the commutative case. There is an implementation to compute Gröbner bases for \(G\)-algebras in the computer algebra system Singular. If \(K=\mathbb Q\) it is known that there is often an intermediate coefficient swell during the computation. This can be avoided by using modular methods. This means to reduce the given ideal modulo several primes, compute a Gröbner basis for each reduced ideal and use Chinese remaindering and rational reconstruction to find the desired Gröbner basis over \(\mathbb Q\). The paper develops the theory (known in the commutative case) for \(G\)-algebras and describes the corresponding implementation in Singular.