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 provide a combinatorial description of critical branchings of operated polygraphs using the structure of polyautomata that we introduce in this paper. Polyautomata extend linear polygraphs equipped with an operator structure formalized by a pushdown automaton. We show how to construct polygraphic resolutions of free operated algebras from their confluent and terminating presentations. Finally, we apply our constructions to several families of operated algebras, including Rota-Baxter algebras, differential algebras, and differential Rota-Baxter algebras.