Polygraphic resolutions for operated algebras

Abstract

This paper introduces the structure of operated polygraphs as a categorical model for rewriting in operated algebras, generalizing Gröbner--Shirshov bases with non-monomial termination orders. We show how to construct polygraphic resolutions of free operated algebras from confluent and terminating presentations. We provide a combinatorial description of critical branchings of operated polygraphs using the structure of polyautomata introduced in this paper. Polyautomata are linear polygraphs equipped with an operator structure formalized by a pushdown automaton. Finally, we apply our constructions to several families of operated algebras, including Rota--Baxter algebras, differential algebras, and differential Rota--Baxter algebras.