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.
Recommendations
Cites work
- scientific article; zbMATH DE number 2134022 (Why is no real title available?)
- scientific article; zbMATH DE number 19499 (Why is no real title available?)
- scientific article; zbMATH DE number 2028926 (Why is no real title available?)
- scientific article; zbMATH DE number 2152044 (Why is no real title available?)
- scientific article; zbMATH DE number 2222247 (Why is no real title available?)
- A 2-categorical pasting theorem
- A relationship between trees and Kelly–Mac Lane graphs
- 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
- Polynomial functors and polynomial monads
- Polynomial functors and trees
- The combinatorics of n-categorical pasting
- Types for Proofs and Programs
- Weak \(n\)-categories: Comparing opetopic foundations.
- Weak \(n\)-categories: Opetopic and multitopic foundations.
Cited in
(32)- List Objects with Algebraic Structure
- Opetopes and chain complexes
- Functorial polar functions
- Polynomial functors and trees
- A sequent calculus for opetopes
- Polynomial functors and combinatorial Dyson-Schwinger equations
- A Cartesian bicategory of polynomial functors in homotopy type theory
- Polynomial filtrations and Lannes' \(T\)-functor
- Categorification of Hopf algebras of rooted trees.
- Polynomial monads and delooping of mapping spaces
- scientific article; zbMATH DE number 764510 (Why is no real title available?)
- On embedding polynomial functors in symmetric powers
- Quantitative Polynomial Functors (Early Ideas)
- The incidence comodule bialgebra of the Baez-Dolan construction
- Discrete Generalised Polynomial Functors
- A Calculus of Terms for Coalgebras of Polynomial Functors
- Operads as polynomial 2-monads
- A Linear Category of Polynomial Functors (extensional part)
- Polynomial functors and polynomial monads
- Opetopic algebras I: Algebraic structures on opetopic sets
- Data types with symmetries and polynomial functors over groupoids
- Groupoids and Faà di Bruno formulae for Green functions in bialgebras of trees.
- Cacti and filtered distributive laws
- Polygraphs and Discrete Conduch{\'e} $\omega$-Functors
- On the duality between trees and disks
- Combinatorial structure of type dependency
- Syntactic approaches to opetopes
- Homotopy theory for algebras over polynomial monads
- The formal theory of monoidal monads
- The web monoid and opetopic sets
- Actads
- A combinatorial-topological shape category for polygraphs
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)
