Related papers: Shuffle polygraphic resolutions for operads
In this paper, we introduce certain new features of the shuffle algebra, that will allow us to obtain explicit formulas for the isomorphism between its Drinfeld double and the elliptic Hall algebra.
In this paper, we study the averaging operator by assigning a rewriting system to it. We obtain some basic results on the kind of rewriting system we used. In particular, we obtain a sufficient and necessary condition for the confluence. We…
We study the confluence property of abstract rewriting systems internal to cubical categories. We introduce cubical contractions, a higher-dimensional generalisation of reductions to normal forms, and employ them to construct cubical…
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…
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…
The structure of a $k$-fold monoidal category as introduced by Balteanu, Fiedorowicz, Schw\"anzl and Vogt can be seen as a weaker structure than a symmetric or even braided monoidal category. In this paper we show that it is still…
The class of input-output systems representable as Chen-Fliess series arises often in control theory. One well known drawback of this representation, however, is that the iterated integrals which appear in these series are algebraically…
Process theories provide a powerful framework for describing compositional structures across diverse fields, from quantum mechanics to computational linguistics. Traditionally, they have been formalized using symmetric monoidal categories…
We establish a highly flexible condition that guarantees that all colored symmetric operads in a symmetric monoidal model category are admissible, i.e., the category of algebras over any operad admits a model structure transferred from the…
We relate shuffle algebras, as defined by Nichols, Feigin-Odesskii and Rosso, to perverse sheaves on symmetric products of the complex line (i.e., on the spaces of monic polynomials stratified by multiplicities of roots). More precisely, we…
When iteratively solving linear systems By=b with Hermitian positive semi-definite $B$, and in particular when solving least-squares problems for $Ax=b$ by reformulating them as $AA^\ast y=b$, it is often observed that SOR-type methods…
String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is…
An operad describes a category of algebras and a (co)homology theory for these algebras may be formulated using the homological algebra of operads. A morphism of operads $f:\mathcal{O}\rightarrow\mathcal{P}$ describes a functor allowing a…
The purpose of this exposition is to compare the constructions of classical nonsymmetric operads (and their algebras) to that of the globular operads of Leinster and Batanin. It is hoped that, through this comparison, understanding algebras…
We introduce twisted arrow categories of operads and of algebras over operads. Up to equivalence of categories, the simplex category $\Delta$, Segal's category $\Gamma$, Connes cyclic category $\Lambda$, Moerdijk-Weiss dendroidal category…
The operad of moulds is realized in terms of an operational calculus of formal integrals (continuous formal power series). This leads to many simplifications and to the discovery of various suboperads. In particular, we prove a conjecture…
In this paper, we introduce a notion of categorified cyclic operad for set-based cyclic operads with symmetries. Our categorification is obtained by relaxing defining axioms of cyclic operads to isomorphisms and by formulating coherence…
In this paper, we first give formulas for the order polynomial $\Omega (\Pw; t)$ and the Eulerian polynomial $e(\Pw; \lambda)$ of a finite labeled poset $(P, \omega)$ using the adjacency matrix of what we call the $\omega$-graph of $(P,…
We construct an explicit Hopf algebra isomorphism from the algebra of heap-ordered trees to that of quasi-symmetric functions, generated by formal permutations, which is a lift of the natural projection of the Connes-Kreimer algebra of…
We consider the anti-symmetrization of the half-shuffle on words, which we call the 'area' operator, since it corresponds to taking the signed area of elements of the iterated-integral signature. The tensor algebra is a so-called Tortkara…