Shuffle polygraphic resolutions for operads

DOI10.1112/JLMS.12681MaRDI QIDQ6134654zbMATH OpenOpenAlexFDO

Publication date 22 August 2023

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2012.15718

Grammars and rewriting systems (68Q42) Algebraic operads, cooperads, and Koszul duality (18M70) Strict omega-categories, computads, polygraphs (18N30)

Abstract: Shuffle operads were introduced to forget the symmetric group actions on symmetric operads while preserving all possible operadic compositions. Rewriting methods were then applied to symmetric operads via shuffle operads: in particular, a notion of Gr"obner basis was introduced for shuffle operads with respect to a total order on tree monomials. In this article, we introduce the structure of shuffle polygraphs as a categorical model for rewriting in shuffle operads, which generalizes the Gr"obner bases approach by removing the constraint of a monomial order for the orientation of the rewriting rules. We define w-operads as internal w-categories in the category of shuffle operads. We show how to extend a convergent shuffle polygraph into a shuffle polygraphic resolution generated by the overlapping branchings of the original polygraph. Finally, we prove that a shuffle operad presented by a quadratic convergent shuffle polygraph is Koszul.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Shuffle polygraphic resolutions for operads

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134654)