多项式函子和opetopes
Polynomial functors and opetopes
摘要:
我们给出了一个小学和直接的组合定义opetopes的树木,非常适合图形化操作和显式计算。为了将我们的定义与经典定义联系起来,我们将运算符的Baez-Dolan切片构造转换为多项式单子:我们的opetopes自然地表现为多项式单子的类型,通过迭代Baez-Dolan构造获得,从平凡单子开始。我们表明,我们的概念opetope同意Leinster的。接下来,我们观察opetopes的暂停操作,并定义稳定opetopes的概念。稳定opetopes形成Baez-Dolan构造的最小不动点。最后一节是专门的例子计算,并指出如何演算opetopes是非常适合机器实现。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。