Polynomial functors and opetopes
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
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. (C) 2010 Elsevier Inc All rights reserved
Originalsprog | Engelsk |
---|---|
Tidsskrift | Advances in Mathematics |
Vol/bind | 224 |
Udgave nummer | 6 |
Sider (fra-til) | 2690-2737 |
Antal sider | 48 |
ISSN | 0001-8708 |
DOI | |
Status | Udgivet - 20 aug. 2010 |
Eksternt udgivet | Ja |
ID: 331502175