A dynamic F4 algorithm to compute Gröbner bases (Q2025446)

\textit{B. Buchberger} [J. Symb. Comput. 41, No. 3--4, 475--511 (2006; Zbl 1158.01307)] introduced the notion of a Gröbner basis as well as the first algorithm to compute it. Since then, several attempts have been made to improve this computation. In [J. Pure Appl. Algebra 139, No. 1--3, 61--88 (1999; Zbl 0930.68174)], \textit{J.-C. Faugère} described his F\(_4\) algorithm by an intensive use of linear algebra techniques to compute Gröbner bases. For some of the applications, one just needs a Gröbner basis and in particular a basis with far fewer polynomials is more efficient in practice. In this direction, \textit{M. Caboara} [in: ISSAC '93. Proceedings of the 1993 international symposium on Symbolic and algebraic computation, Kiev, Ukraine, July 6--8, 1993. Baltimore, MD: ACM Press. 275--283 (1993; Zbl 0922.13021)] and \textit{P. Gritzmann} and \textit{B. Sturmfels} [SIAM J. Discrete Math. 6, No. 2, 246--269 (1993; Zbl 0798.68157)], independently and based on the original Buchberger's algorithm, described a so-called ``dynamic'' approach to compute such a basis. In the paper under review, the author presents a variant of the F\(_4\) algorithm by applying dynamic technique to compute a small Gröbner basis, and the behaviour of this algorithm has been examined on some commonly referenced benchmark ideals.