Article
Full entry |
PDF
(0.9 MB)
Feedback
PDF
(0.9 MB)
Feedback
Keywords:
operad; cyclic operad; unrooted trees; syntax; rewriting system; formalisation
operad; cyclic operad; unrooted trees; syntax; rewriting system; formalisation
Summary:
We propose a $\lambda$-calculus-style formal language, called the $\mu$-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.
References:
[1] Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press
[2] Costello, K.: The A-infinity operad and the moduli space or curves. https://arxiv.org/abs/math/0402015
[3] Curien, P. -L., Herbelin, H.: The duality of computation. ACM SIGPLAN Notices, Volume 35 Issue 9, 233-243. DOI 10.1145/357766.351262
[4] Fiore, M. P., Campos, M. Devesas: The Algebra of Directed Acyclic Graphs. In Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, Volume 7860 of Lecture Notes in Computer Science
[5] Getzler, E.: Operads revisited. Algebra, arithmetics, and geometry: in honor of Yu. I. Manin, Vol. I, volume 269 of Progr. Math. p. 675-698. Birkhäuser, Boston
[6] Getzler, E., Kapranov, M.: Cyclic operads and cyclic homology. Geom., Top., and Phys. for Raoul Bott, International Press, Cambridge, MA, 167-201
[7] Joyal, A.: Une théorie combinatoire des séries formelles. Advances in Mathematics, 42 1-82 DOI 10.1016/0001-8708(81)90052-9
[8] Joyal, A., Kock, J.: Feynman Graphs, and Nerve Theorem for Compact Symmetric Multicategories. (Extended Abstract), Electronic Notes in Theoretical Computer Science 270 (2) 105-113 DOI 10.1016/j.entcs.2011.01.025
[9] Kaufmann, R. M., Ward, B. C.: Feynman categories. https://arxiv.org/abs/1312.1269
[10] Kontsevich, M., Manin, Y.: Gromov-Witten Classes, Quantum Cohomology, and Enumerative Geometry. Comm. Math. Phys., 164:525-562
[11] Lamarche, F.: On the algebra of structural contexts. Mathematical Structures in Computer Science, Cambridge University Press, 51 p
[12] Manin, Y. I.: Frobenius manifolds, quantum cohomology, and moduli spaces. volume 47 of AMS Colloquium Publications, American mathematical Society, Providence, RI
[13] Markl, M.: Models for operads. Comm. Algebra, 24(4):1471–1500 Zbl 0848.18003
[14] Markl, M.: Modular envelopes, OSFT and nonsymmetric (non-Σ) modular operads. J. Noncommut. Geom. 10, 775-809 DOI 10.4171/jncg/248
[15] Markl, M.: Operads and PROPs. Elsevier, Handbook for Algebra, Vol. 5, 87-140 DOI 10.1016/S1570-7954(07)05002-4 | Zbl 1211.18007
[16] Markl, M., Schnider, S., Stasheff, J.: Operads in Algebra, Topology and Physics. American Mathematical Society, Providence
[17] May, J. P.: The geometry of iterated loop spaces. volume 271 of Lectures Notes in Mathematics. Springer-Verlag, Berlin
[18] Obradović, J.: Monoid-like definitions of cyclic operads. Theory and Applications of Categories, Vol. 32, No. 12, pp. 396-436 DOI 10.70930/tac/iyc4m2jq
[19] Pierce, B. C.: Types and Programming Languages. The MIT Press
Search
Partner of
