A formal language for cyclic operads
From MaRDI portal
Publication:3121012
zbMATH Open1411.18016arXiv1602.07502MaRDI QIDQ3121012FDOQ3121012
Authors: Pierre-Louis Curien, Jovana Obradović
Publication date: 19 March 2019
Abstract: We propose a -calculus-style formal language, called the -syntax, as a lightweight representation of the structure of cyclic operads. We illustrate the rewriting methods behind the formalism by giving a complete step-by-step proof of the equivalence between the unbiased and biased definitions of cyclic operads.
Full work available at URL: https://arxiv.org/abs/1602.07502
Recommendations
Cites Work
- The geometry of iterated loop spaces
- Title not available (Why is that?)
- Gromov-Witten classes, quantum cohomology, and enumerative geometry
- Feynman graphs, and nerve theorem for compact symmetric multicategories (extended abstract)
- Title not available (Why is that?)
- Models for operads
- Title not available (Why is that?)
- Term Rewriting and All That
- Feynman categories
- The algebra of directed acyclic graphs
- Types and programing languages
- Modular envelopes, OSFT and nonsymmetric (non-\(\Sigma\)) modular operads
- Une théorie combinatoire des séries formelles
- The duality of computation
- Monoid-like definitions of cyclic operad
- Operads revisited
Cited In (7)
This page was built for publication: A formal language for cyclic operads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121012)