Related papers: Word operads and admissible orderings
We develop versions of the Poincar\'e-Birkhoff-Witt and Cartier-Milnor-Moore theorems in the setting of braided Hopf algebras. To do so, we introduce new analogues of a Lie algebra in the setting of a braided monoidal category, using the…
We show that a certain class of categorical operads give rise to $E_n$-operads after geometric realization. The main arguments are purely combinatorial and avoid the technical topological assumptions otherwise found in the literature.
Guided by the microcosm principle of Baez-Dolan and by the algebraic definitions of operads of Kelly and Fiore, we introduce two "monoid-like" definitions of cyclic operads, one for the original, "exchangable-output" characterisation of…
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…
We study cobordisms of a class of topological operads called ``manifold operads''. These operads are generalizations of the Fulton-MacPherson operad: an operad built from configurations of points in Euclidean space. Cobordism of manifold…
Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…
Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…
Operads are algebraic devices offering a formalization of the concept of operations with several inputs and one output. Such operations can be naturally composed to form bigger and more complex ones. Coming historically from algebraic…
We study the operad structure on the homology of moduli spaces of pointed rooted trees of $d$-dimensional projective spaces, introduced by Chen, Gibney and Krashen a couple of decades ago. We describe this operad by generators and…
The join operad arises from the combinatorial study of the iterated join of simplices. We study a suitable simplicial version of this operad which includes the symmetries given by permutations of the factors of the join. From this…
Partially commutative monoids provide a powerful tool to study graphs, viewingwalks as words whose letters, the edges of the graph, obey a specific commutation rule. A particularclass of traces emerges from this framework, the hikes, whose…
We develop a self-dual, bivariant extension of the concept of an operadic category, its associated operads and their algebras. Our new theory covers, besides all classical subjects, also generalized traces and bivariant versions of…
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 introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…
The operads of Poisson and Gerstenhaber algebras are generated by a single binary element if we consider them as Hopf operads (i.e. as operads in the category of cocommutative coalgebras). In this note we discuss in details the Hopf operads…
Operads were originally defined as V-operads, that is, enriched in a symmetric or braided monoidal category V. The symmetry or braiding in V is required in order to describe the associativity axiom the operads must obey, as well as the…
We construct in this article an explicit geometric rough path over arbitrary $d$-dimensional paths with finite $1/\alpha$-variation for any $\alpha\in(0,1)$. The method may be coined as 'Fourier normal ordering', since it consists in a…
Gr\"obner bases, in their noncommutative version, and word reversing are methods for solving the word problem of a presented monoid, and both rely on iteratively completing the initial list of relations. Simple examples may suggest to…
Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…