Related papers: Word operads and admissible orderings
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…
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…
We define a new monoidal category on collections (shuffle composition). Monoids in this category (shuffle operads) turn out to bring a new insight in the theory of symmetric operads. For this category, we develop the machinery of Gr\"obner…
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…
The main ideas developed in this habilitation thesis consist in endowing combinatorial objects (words, permutations, trees, Young tableaux, etc.) with operations in order to construct algebraic structures. This process allows, by studying…
Shuffle operads were introduced to forget the symmetric group actions on symmetric operads while preserving all possible operadic compositions. Rewriting methods were then applied to symmetric operads via shuffle operads: in particular, a…
We define new combinatorial objects, called shrubs, such that forests of rooted trees are shrubs. We then introduce a structure of operad on shrubs. We show that this operad is contained in the Zinbiel operad, by using the inclusion of…
A new hierarchy of operads over the linear spans of $\delta$-cliffs, which are some words of integers, is introduced. These operads are intended to be analogues of the operad of permutations, also known as the associative symmetric operad.…
In this thesis, we present a flexible framework for specifying and constructing operads which are suited to reasoning about network construction. The data used to present these operads is called a \emph{network model}, a monoidal variant of…
We give a description of unital operads in a symmetric monoidal category as monoids in a monoidal category of unital $\Lambda$-sequences. This is a new variant of Kelly's old description of operads as monoids in the monoidal category of…
We generalize the construction of multitildes in the aim to provide multitilde operators for regular languages. We show that the underliying algebraic structure involves the action of some operads. An operad is an algebraic structure that…
We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…
In this work we provide a definition of a coloured operad as a monoid in some monoidal category, and develop the machinery of Gr\"obner bases for coloured operads. Among the examples for which we show the existance of a quadratic Gr\"obner…
A general notion of operad is given, which includes as instances, the operads originally conceived to study loop spaces, as well as the higher operads that arise in the globular approach to higher dimensional algebra. In the framework of…
Operads may be represented as symmetric monoidal functors on a small symmetric monoidal category. We discuss the axioms which must be imposed on a symmetric monoidal functor in order that it give rise to a theory similar to the theory of…
We apply operad theory to enumerative combinatorics in order to count the number of shuffles between series-parallel posets and chains. We work with three types of shuffles, two of them noncommutative, for example a left deck-divider…
We introduce a systematic method for constructing set-theoretic operads via iterated application of the power set functor, and use it to uncover a hierarchy connecting several classical operads. Starting from the permutative operad, the…
We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous…
The main goal of this paper is to present a way to compute Quillen homology of operads. The key idea is to use the notion of a shuffle operad we introduced earlier; this allows to compute, for a symmetric operad, the homology classes and…
We introduce a functorial construction $\mathsf{C}$ which takes unitary magmas $\mathcal{M}$ as input and produces operads. The obtained operads involve configurations of chords labeled by elements of $\mathcal{M}$, called…