Polynomial functors and opetopes
From MaRDI portal
Publication:984889
DOI10.1016/J.AIM.2010.02.012zbMATH Open1221.18001arXiv0706.1033OpenAlexW2022608773MaRDI QIDQ984889FDOQ984889
Authors: Joachim Kock, André Joyal, Jean-François Mascari, Michael Batanin 
Publication date: 20 July 2010
Published in: Advances in Mathematics (Search for Journal in Brave)
Abstract: We give an elementary and direct combinatorial definition of opetopes in terms of trees, well-suited for graphical manipulation and explicit computation. To relate our definition to the classical definition, we recast the Baez-Dolan slice construction for operads in terms of polynomial monads: our opetopes appear naturally as types for polynomial monads obtained by iterating the Baez-Dolan construction, starting with the trivial monad. We show that our notion of opetope agrees with Leinster's. Next we observe a suspension operation for opetopes, and define a notion of stable opetopes. Stable opetopes form a least fixpoint for the Baez-Dolan construction. A final section is devoted to example computations, and indicates also how the calculus of opetopes is well-suited for machine implementation.
Full work available at URL: https://arxiv.org/abs/0706.1033
Recommendations
Cites Work
- Polynomial functors and trees
- Title not available (Why is that?)
- Higher-dimensional algebra. III: \(n\)-categories and the algebra of opetopes
- Limits indexed by category-valued 2-functors
- On weak higher dimensional categories. I: Part 1
- Title not available (Why is that?)
- Polynomial functors and polynomial monads
- Types for Proofs and Programs
- The combinatorics of n-categorical pasting
- A 2-categorical pasting theorem
- Title not available (Why is that?)
- Weak \(n\)-categories: Opetopic and multitopic foundations.
- Title not available (Why is that?)
- Weak \(n\)-categories: Comparing opetopic foundations.
- Title not available (Why is that?)
- A relationship between trees and Kelly–Mac Lane graphs
Cited In (30)
- A Calculus of Terms for Coalgebras of Polynomial Functors
- A Cartesian bicategory of polynomial functors in homotopy type theory
- Syntactic approaches to opetopes
- List Objects with Algebraic Structure
- Opetopes and chain complexes
- Quantitative Polynomial Functors (Early Ideas)
- On the duality between trees and disks
- The incidence comodule bialgebra of the Baez-Dolan construction
- Groupoids and Faà di Bruno formulae for Green functions in bialgebras of trees.
- Title not available (Why is that?)
- Polynomial functors and combinatorial Dyson–Schwinger equations
- Functorial polar functions
- Polynomial functors and trees
- The formal theory of monoidal monads
- Polynomial filtrations and Lannes' \(T\)-functor
- On embedding polynomial functors in symmetric powers
- A Linear Category of Polynomial Functors (extensional part)
- The web monoid and opetopic sets
- Actads
- Cacti and filtered distributive laws
- Polynomial monads and delooping of mapping spaces
- Homotopy theory for algebras over polynomial monads
- Categorification of Hopf algebras of rooted trees.
- A combinatorial-topological shape category for polygraphs
- Data Types with Symmetries and Polynomial Functors over Groupoids
- Combinatorial structure of type dependency
- Polynomial functors and polynomial monads
- Opetopic algebras I: Algebraic structures on opetopic sets
- Discrete Generalised Polynomial Functors
- Polygraphs and Discrete Conduch{\'e} $\omega$-Functors
This page was built for publication: Polynomial functors and opetopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984889)
