F4完备化过程的格形式
A lattice formulation of the F4 completion procedure
摘要:
我们写了一个程序构造非交换Groebner基地。约简是由特定的线性投影器完成的,称为约简算子。该算子使我们能够使用一个格结构同时减少每个S-多项式到一个唯一的范式。我们编写了一个实现以及一个例子来说明我们的过程。此外,格的构造是通过高斯消去法完成的,这将我们的过程与构造交换Groebner基的F4算法联系起来。
英文摘要:
We write a procedure for constructing noncommutative Groebner bases. Reductions are done by particular linear projectors, called reduction operators. The operators enable us to use a lattice construction to reduce simultaneously each S-polynomial into a unique normal form. We write an implementation as well as an example to illustrate our procedure. Moreover, the lattice construction is done by Gaussian elimination, which relates our procedure to the F4 algorithm for constructing commutative Groebner bases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。