We introduce a functor ${\sf As}$ from the category of posets to the category of nonsymmetric binary and quadratic operads, establishing a new connection between these two categories. Each operad obtained by the construction ${\sf As}$ provides a generalization of the associative operad because all of its generating operations are associative. This construction has a very singular property: the operads obtained from ${\sf As}$ are almost never basic. Besides, the properties of the obtained operads, such as Koszulity, basicity, associative elements, realization, and dimensions, depend on combinatorial properties of the starting posets. Among others, we show that the property of being a forest for the Hasse diagram of the starting poset implies that the obtained operad is Koszul. Moreover, we show that the construction ${\sf As}$ restricted to a certain family of posets with Hasse diagrams satisfying some combinatorial properties is closed under Koszul duality.
We prove that the operad of mock partially associative $n$-ary algebras is not Koszul, as conjectured by the second and the third author in 2009, and utilise the Zeilberger's algorithm for hypergeometric summation to demonstrate that non-Koszulness of that operad cannot be established by hunting for negative coefficients in the inverse of its Poincaré series.
We define, for a somewhat standard forgetful functor from nonsymmetric operads to weight graded associative algebras, two functorial "enveloping operad" functors, the right inverse and the left adjoint of the forgetful functor. Those functors turn out to be related by operadic Koszul duality, and that relationship can be utilised to provide examples showing limitations of two standard tools of the Koszul duality theory. We also apply these functors to get a homotopical algebra proof of the Lagrange inversion formula.
We describe four natural operad structures on the vector space generated by isomorphism classes of finite posets. The three last ones are set-theoretical and can be seen as a simplified version of the first, the same way the NAP operad behaves with respect to the pre-Lie operad. Moreover the two first ones are isomorphic.
A new hierarchy of combinatorial operads is introduced, involving families of regular polygons with configurations of arcs, called decorated cliques. This hierarchy contains, among others, operads on noncrossing configurations, Motzkin objects, forests, dissections of polygons, and involutions. All this is a consequence of the definition of a general functorial construction from unitary magmas to operads. We study some of its main properties and show that this construction includes the operad of bicolored noncrossing configurations and the operads of simple and double multi-tildes. We focus in…
División de Ingenierías, Universidad de Guanajuato（瓜纳华托大学工程学院）；Research Data Centre, German Federal Pension Insurance（德国联邦养老金保险研究数据中心）；Yonsei University（延世大学）
We introduce, by adopting the point of view and the tools offered by the theory of operads, a generalization on a nonnegative integer parameter $γ$ of diassociative algebras of Loday, called $γ$-pluriassociative algebras. By Koszul duality of operads, we obtain a generalization of dendriform algebras, called $γ$-polydendriform algebras. In the same manner as dendriform algebras are suitable devices to split associative operations into two parts, $γ$-polydendriform algebras seem adapted structures to split associative operations into $2 γ$ operations so that some partial sums of these operation…
Dendriform algebras form a category of algebras recently introduced by Loday. A dendriform algebra is a vector space endowed with two nonassociative binary operations satisfying some relations. Any dendriform algebra is an algebra over the dendriform operad, the Koszul dual of the diassociative operad. We introduce here, by adopting the point of view and the tools offered by the theory of operads, a generalization on a nonnegative integer parameter $γ$ of dendriform algebras, called $γ$-polydendriform algebras, so that $1$-polydendriform algebras are dendriform algebras. For that, we consider …
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 shuffle $A$ between $P$ and $Q$ is a shuffle of the posets in which, on every maximal chain $m\subset A$, the minimum and maximum elements belong to $P$ and no two consecutive points of $Q$ appear consecutively on $m$. The number of left deck-divider shuffles of $P$ and $Q$ differ from the number of left deck-divider shuffles of $Q$ and $P$. The generating functio…
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 algebraically the structures thus obtained (changes of bases, generating sets, presentations, morphisms, representations), to collect combinatorial information about the underlying objects. The algebraic structures the most encountered here are magmas, posets, associative algebras, dendriform algebras, Hopf bialgebras, operads, and pros. This work explores th…
A root ideal arrangement $A_I$ is the set of reflecting hyperplanes corresponding to the roots in an order ideal $I$ of the root poset on the positive roots of a finite crystallographic root system. A characterisation of supersolvable root ideal arrangements is obtained. Namely, $A_I$ is supersolvable if and only if $I$ is chain peelable, meaning that it is possible to reach the empty poset from $I$ by in each step removing a maximal chain which is also an order filter. In particular, supersolvability is preserved under taking subideals. We identify the minimal ideals that correspond to non-su…
