Combinatorial operads from monoids

Samuele Giraudo (1)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge

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\"oder 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.

Mots clés: Operad; Tree; Monoid; Rewriting

Domaines: Combinatoire [math.CO]; Algèbres quantiques [math.QA]

Samuele Giraudo. Combinatorial operads from monoids. Journal of Algebraic Combinatorics, 2015, 41 (2), pp.493-538. ⟨10.1007/s10801-014-0543-4⟩. ⟨hal-01236471⟩