由幺半群构造组合运算
Constructing combinatorial operads from monoids
摘要：
我们介绍了一个函子建设，从幺半群，产生一个集操作数。我们获得新的（对称或不）的操作作为子操作或从加法幺半群获得的操作的子操作。这些涉及到各种熟悉的组合对象：停车功能，包装的话，平面有根树，广义戴克路径，施罗德树，Motzkin路径，整数组合，定向动物等，我们还检索一些已知的操作：岩浆操作，交换关联操作，和双关联操作。
英文摘要：
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 operad obtained from the additive monoid. These involve various familiar combinatorial objects: parking functions, packed words, planar rooted trees, generalized Dyck paths, Schröder trees, Motzkin paths, integer compositions, directed animals, etc. We also retrieve some known operads: the magmatic operad, the commutative associative operad, and the diassociative operad.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
