Papers
Topics
Authors
Recent
Search
2000 character limit reached

Actads

Published 19 Aug 2021 in math.AT, math.CT, and math.LO | (2108.08413v1)

Abstract: In this paper, I introduce a new generalization of the concept of an operad, further generalizing the concept of an opetope introduced by Baez and Dolan, who used this for the definition of their version of non-strict $n$-categories. Opetopes arise from iterating a certain construction on operads called the $+$-construction, starting with monoids. The first step gives rise to plain operads, i.e. operads without symmetries. The permutation axiom in a symmetric operad, however, is an additional structure resulting from permutation of variables, independent of the structure of a monoid. Even though we can apply the $+$-construction to symmetric operads, there is the possibility of introducing a completely different kind of permutations on the higher levels by again permuting variables without regard to the structure on the previous levels. Defining and investigating these structures is the main purpose of this paper. The structures obtained in this way is what I call $n$-actads. In $n$-actads with $n>1$, the permutations on the different levels give rise to a certain special kind of $n$-fold category. I also explore the concept of iterated algebras over an $n$-actad (generalizing an algebra and module over an operad), and various types of iterated units. I give some examples of algebras over $2$-actads, and show how they can be used to construct certain new interesting homotopy types of operads. I also discuss a connection between actads and ordinal notation.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.