Papers
Topics
Authors
Recent
Search
2000 character limit reached

Categorified cyclic operads

Published 21 Jun 2017 in math.CT | (1706.06788v3)

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 Do\v{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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.