Axioms for a theory of signature bases - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Symbolic Computation Année : 2024

Axioms for a theory of signature bases

Résumé

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 (924.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY - Paternité

Dates et versions

hal-03830003 , version 1 (26-10-2022)
hal-03830003 , version 2 (28-11-2023)
hal-03830003 , version 3 (08-01-2024)

Licence

Paternité

Identifiants

Citer

Pierre Lairez. Axioms for a theory of signature bases. Journal of Symbolic Computation, 2024, 123, pp.102275. ⟨10.1016/j.jsc.2023.102275⟩. ⟨hal-03830003v3⟩
47 Consultations
19 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More