Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases (Q382761): Difference between revisions

Gröbner bases are the workhorse of computational algebra and there are several competing algorithms to compute them. One competitive algorithm is Faugère's F5 algorithm which is the basis for the work here about a variant of F5 dubbed G\(^2\)V for SAGBI bases of invariant rings. A SAGBI basis is for a subalgebra what a Gröbner basis is for an ideal. The problem with SAGBI bases is that they need not exist, at least not finite ones. The paper at hand discusses implementation details of the G\(^2\)V algorithm for SAGBI bases of invariant rings. The authors also compare their implementation in Maple to an implementation of the invariant F5 algorithm which serves the same purpose.