Categorified cyclic operads
From MaRDI portal
Publication:2303776
Abstract: In this paper, we introduce a notion of categorified cyclic operad for set-based cyclic operads with symmetries. Our categorification is obtained by relaxing defining axioms of cyclic operads to isomorphisms and by formulating coherence conditions for these isomorphisms. The coherence theorem that we prove has the form "all diagrams of canonical isomorphisms commute". Our coherence results come in two flavours, corresponding to the "entries-only" and "exchangeable-output" definitions of cyclic operads. Our proof of coherence in the entries-only style is of syntactic nature and relies on the coherence of categorified non-symmetric operads established by Dov{s}en and Petri'c. We obtain the coherence in the exchangeable-output style by "lifting" the equivalence between entries-only and exchangeable-output cyclic operads, set up by the second author. Finally, we show that a generalisation of the structure of profunctors of B' enabou provides an example of categorified cyclic operad, and we exploit the coherence of categorified cyclic operads in proving that the Feynman category for cyclic operads, due to Kaufmann and Ward, admits an odd version.
Recommendations
Cites work
- A formal language for cyclic operads
- Algebraic structure of string field theory
- Coherent presentations of monoidal categories
- Cyclic multicategories, multivariable adjunctions and mates
- Feynman categories
- Higher-dimensional word problems with applications to equational logic
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 626734 (Why is no real title available?)
- scientific article; zbMATH DE number 1963527 (Why is no real title available?)
- scientific article; zbMATH DE number 1757930 (Why is no real title available?)
- scientific article; zbMATH DE number 970691 (Why is no real title available?)
- scientific article; zbMATH DE number 2222247 (Why is no real title available?)
- Hypergraph polytopes
- Limits indexed by category-valued 2-functors
- Modular envelopes, OSFT and nonsymmetric (non-\(\Sigma\)) modular operads
- Monoid-like definitions of cyclic operad
- Operads and PROPs
- Polygraphs of finite derivation type
- Symmetric homotopy theory for operads
- Syntactic aspects of hypergraph polytopes
- Weak Cat-operads
Cited in
(8)- Higher cyclic operads
- Graphical combinatorics and a distributive law for modular operads
- Syntactic aspects of hypergraph polytopes
- Monoid-like definitions of cyclic operad
- A formal language for cyclic operads
- Dwyer-Kan homotopy theory for cyclic operads
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- Twisted arrow categories, operads and Segal conditions
This page was built for publication: Categorified cyclic operads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2303776)
