Axioms for a theory of signature bases (Q6149142): Difference between revisions

\textit{J.-C. Faugère} [in: Proceedings of the 2002 international symposium on symbolic and algebraic computation, ISSAC 2002, Lille, France, July 07--10, 2002. New York, NY: ACM Press. 75--83 (2002; Zbl 1072.68664)] introduced the F\(_5\) algorithm; an incremental signature-based method for computing Gröbner bases. This algorithm proposed several criteria, different from Buchberger's criteria, to eliminate unnecessary computations. However, the theoretical framework was challenging to comprehend and required addressing issues concerning the correctness and termination. In this paper, the author presents an axiomatic framework for the signature-based algorithm for computing Gröbner bases. This approach can be applied in various contexts such as submodules, F4-style reduction, noncommutative rings, and non-Noetherian settings. Additionally, it facilitates the exploration of novel concepts and ideas in this field.