Signature-based standard basis algorithm under the framework of GVW algorithm (Q6615411)

This paper focuses on the improvement of computing Gröbner bases. The starting point is the papers [\textit{S. Gao} et al., ISSAC 2010, 13--19 (2010; Zbl 1321.68531); \textit{S. Gao} et al., Math. Comput. 85, No. 297, 449--465 (2016; Zbl 1331.13018)], usually referred as GVM algorithm. In this paper, based on the famous Mora normal form algorithm, the authors extend the cover theorem to any semigroup order, which can be either global, local or even mixed. As a consequence, an algorithm for signature-based standard bases is presented for any semigroup order under the framework of the GVW algorithm is presented.