A Lattice Formulation of the F 4 Completion Procedure

Cyrille Chenavier 1, 2
2 PI.R2 - Design, study and implementation of languages for proofs and programs
Inria de Paris, CNRS - Centre National de la Recherche Scientifique, UPD7 - Université Paris Diderot - Paris 7, PPS - Preuves, Programmes et Systèmes
Abstract : We introduce a new procedure for constructing noncommutative Gröbner bases using a lattice formulation of completion. This leads to a lattice description of the noncommutative F4 procedure. Our procedure is based on the lattice structure of reduction operators which provides a lattice description of the confluence property. We relate reduction operators to noncommutative Gröbner bases, we show the Diamond Lemma for reduction operators and we deduce the lattice interpretation of the F4 procedure. Finally, we illustrate our procedure with a complete example.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

Contributor : Cyrille Chenavier <>
Submitted on : Tuesday, January 30, 2018 - 1:39:26 PM
Last modification on : Friday, April 19, 2019 - 4:55:26 PM
Document(s) archivé(s) le : Friday, May 25, 2018 - 10:53:12 PM


Files produced by the author(s)


  • HAL Id : hal-01489200, version 2



Cyrille Chenavier. A Lattice Formulation of the F 4 Completion Procedure. 2018. ⟨hal-01489200v2⟩



Record views


Files downloads