Axioms for a theory of signature bases - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Axioms for a theory of signature bases


Twenty years after the discovery of the F5 algorithm, Gr\"obner bases with signatures are still challenging to understand and to adapt to different settings. This contrasts with Buchberger's algorithm, which we can bend in many directions keeping correctness and termination obvious. I propose an axiomatic approach to Gr\"obner bases with signatures with the purpose of uncoupling the theory and the algorithms, and giving general results applicable in many different settings (e.g. Gr\"obner for submodules, F4-style reduction, noncommutative rings, non-Noetherian settings, etc.).
Fichier principal
Vignette du fichier
gb.pdf (359.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03830003 , version 1 (26-10-2022)





Pierre Lairez. Axioms for a theory of signature bases. 2022. ⟨hal-03830003⟩
18 View
9 Download



Gmail Facebook Twitter LinkedIn More