Combinatorial operads from monoids

Abstract

We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operads obtained from usual monoids such as the additive and multiplicative monoids of integers and cyclic monoids. They involve various familiar combinatorial objects: endofunctions, parking functions, packed words, permutations, planar rooted trees, trees with a fixed arity, Schröder trees, Motzkin words, integer compositions, directed animals, and segmented integer compositions. We also recover some already known (symmetric or not) operads: the magmatic operad, the associative commutative operad, the diassociative operad, and the triassociative operad. We provide presentations by generators and relations of all constructed nonsymmetric operads.

42 pages. Complete version of the extended abstracts arXiv:1208.0920 and arXiv:1208.0922

References in corpus (1)

• Construction d'opérades ensemblistes à partir de monoïdes

Cited by in corpus (9)

• Operads from posets and Koszul duality
• Word operads and admissible orderings
• Pluriassociative algebras I: The pluriassociative operad
• Colored operads, series on colored operads, and combinatorial generating systems
• Tree series and pattern avoidance in syntax trees
• Calculus of multilinear differential operators, operator $L_{\infty }$-algebras and ${IBL}_{\infty }$-algebras
• Duality of graded graphs through operads
• Clones of pigmented words and realizations of special classes of monoids
• Cliff operads: a hierarchy of operads on words