Related papers: An analogue of the plactic monoid for binary searc…
In "Hopf algebra of the planar binary trees", Adv. Math. 139 (1998), no. 2, 293--309, we constructed by induction a graded associative product on the vector space generated by the planar binary trees (resp. the permutations). In the present…
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…
We define a class of algebras describing links of binary semi-isolating formulas on a set of realizations for a family of 1-types of a complete theory. These algebras include algebras of isolating formulas considered before. We prove that a…
We present new functional equations for the species of plane and of planar (in the sense of Harary and Palmer, 1973) 2-trees and some associated pointed species. We then deduce the explicit molecular expansion of these species, i.e a…
Braidoids form a counterpart theory to the theory of planar knotoids, just as braids do for three-dimensional links. As such, planar knotoid diagrams represent the same knotoid in $\mathbb{R}^2$ if and only if they can be presented as the…
We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
This paper defines the algebraic structure of tracial post-Lie-Rinehart algebras and describes the free object in this category. Post-Lie-Rinehart algebras is a generalisation of pre-Lie-Rinehart algebras, and of post-Lie algebroids.
Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the conditions for classical binary search trees. Based on the bijective correspondence between signed permutations and leveled…
We are interested in the quantitative analysis of the compaction ratio for two classical families of trees: recursive trees and plane binary increasing trees. These families are typical representatives of tree models with a small depth.…
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…
We classify the $\mathscr{R}$-cross-sections of the monoid of order-preserving transformations on the $n$-element chain in terms of certain binary trees.
We consider a model for topological recursion based on the Hopf Algebra of planar binary trees of Loday and Ronco. We show that extending this Hopf Algebra by identifying pairs of nearest neighbor leaves and producing in this way graphs…
We construct a new monoid structure for Artin groups associated with finite Coxeter systems. This monoid shares with the classical positive braid monoid a crucial algebraic property: it is a Garside monoid. The analogy with the classical…
We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…
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…
Jean-Louis Loday has defined generalised bialgebras and proved structure theorems in this setting which can be seen as general forms of the Poincar\'e-Birkhoff-Witt and the Cartier-Milnor-Moore theorems. It was observed by the present…
These notes are a written version of my talk given at the CARMA workshop in June 2017, with some additional material. I presented a few concepts that have recently been used in the computation of tree-level scattering amplitudes (mostly…
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
Motivated by the study of word problems of monoids, we explore two ways of viewing binary relations on $A^*$ as languages. We exhibit a hierarchy of classes of binary relations on $A^*$, according to the class of languages the relation…