Constructing set-operads from monoids
Let \(M\) be a monoid. Let \(TM(n)\) be the collection of formal words of length \(n\) on the elements of \(M\). The author observes that the collection of these sets \(TM(n)\), \(n\in\mathbb N\), forms a symmetric operad naturally associated to \(M\). He then studies suboperads of the operad \(TM\) associated to the monoids \(M = \mathbb N^k\), \(k = 1,2,3\). He proves that usual word collections occurring in algebraic combinatorics (like endofunctions, parking functions, and other collections of words specified by growth constraints in \(\mathbb N\)), are identified with suboperads of these operads \(TM\).
- Constructing combinatorial operads from monoids
- Combinatorial operads from monoids
- Operads within monoidal pseudo algebras
- Monoid-like definitions of cyclic operad
- Operads in iterated monoidal categories
- Monoidal Grothendieck construction
- Coproducts of monads on Set
- The web monoid and opetopic sets
- A monoid structure on the set of all binary operations over a fixed set
- From operads to dendroidal sets
This page was built for publication: Constructing set-operads from monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q447872)