Skip to Main content Skip to Navigation
Conference papers

Completion in Operads via Essential Syzygies

Abstract : We introduce an improved Gröbner basis completion algorithm for operads. To this end, we define operadic rewriting systems as a machinery to rewrite in operads, whose rewriting rules do not necessarily depend on an ambient monomial order. A Gröbner basis of an operadic ideal can be seen as a confluent and terminating operadic rewriting system; thus, the completion of a Gröbner basis is equivalent to the completion of a rewriting system. We improve the completion algorithm by filtering out redundant S-polynomials and testing only essential ones. Finally, we show how the notion of essential S-polynomials can be used to compute Gröbner bases for syzygy bimodules. This work is motivated by the computation of minimal models of associative algebras and symmetric operads. In this direction, we show how our completion algorithm extends to the case of shuffle operads. CCS Concepts • Computing methodologies → Combinatorial algorithms; Algebraic algorithms.
Document type :
Conference papers
Complete list of metadata
Contributor : Philippe Malbos Connect in order to contact the contributor
Submitted on : Saturday, June 12, 2021 - 1:14:27 AM
Last modification on : Tuesday, April 26, 2022 - 2:00:02 AM
Long-term archiving on: : Monday, September 13, 2021 - 6:04:14 PM


Files produced by the author(s)



Philippe Malbos, Isaac Ren. Completion in Operads via Essential Syzygies. 46th International Symposium on Symbolic and Algebraic Computation, Jul 2021, Saint Petersburg, Russia. ⟨10.1145/3452143.3465552⟩. ⟨hal-03258883⟩



Record views


Files downloads