We introduce the RB algorithm for Gröbner basis computation, a simpler yet equivalent algorithm to F5GEN. RB contains the original unmodified F5 algorithm as a special case, so it is possible to study and understand F5 by considering the simpler RB. We ...
This paper introduces a strategy for signature-based algorithms to compute Gröbner basis. In comparison with Buchberger algorithm, signature-based algorithms generate S-pairs instead of S-polynomials, and operate s-reductions instead of usual reductions ...
In the first sections we extend and generalize Gröbner basis theory to submodules of free right modules over monoid rings. Over free monoids, we adapt the known theory for right ideals and prove versions of Macaulay's basis theorem, the Buchberger ...
Association for Computing Machinery
New York, NY, United States