Related papers: Sets with two associative operation
Much work has been done to identify which binary codes can be represented by collections of open convex or closed convex sets. While not all binary codes can be realized by such sets, here we prove that every binary code can be realized by…
We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the…
We study the free objects in the variety of semigroups and variety of monoids generated by the monoid of all $n \times n$ upper triangular matrices over a commutative semiring. We obtain explicit representations of these, as multiplicative…
Using the technique of higher derived brackets developed by Voronov, we construct a homotopy Loday algebra in the sense of Ammar and Poncin associated to any symplectic $2$-manifold. The algebra we obtain has a particularly nice structure,…
We investigate the algebraic structure on the set of closure operations of a ring. We show the set of closure operations is not a monoid under composition for a discrete valuation ring. Even the set of semiprime operations over a DVR is not…
An independent set in a graph $G$ is a set of pairwise non-adjacent vertices. A tree decomposition of $G$ is a pair $(T, \chi)$ where $T$ is a tree and $\chi : V(T) \rightarrow 2^{V(G)}$ is a function satisfying the following two axioms:…
Loday's dendriform algebras and its siblings pre-Lie and zinbiel have received attention over the past two decades. In recent literature, there has been interest in a generalization of these types of algebra in which each individual…
We extend the basic concepts of Street's formal theory of monads from the setting of 2-categories to that of double categories. In particular, we introduce the double category Mnd(C) of monads in a double category C and define what it means…
Laminar set systems consist of non-crossing subsets of a universe with set inclusion essentially corresponding to the descendant relationship of a tree, the so-called laminar tree. Laminar set systems lie at the core of many graph…
Categorical models of the exponential modality of linear logic will often, but not always, support an operation of differentiation. When they do, we speak of a monoidal differential modality; when they do not, we have merely a monoidal…
Consider partial maps from the free monoid into the field of real numbers with a rational domain. We show that two families of such series are actually the same: the unambiguous rational series on the one hand, and the max-plus and min-plus…
We start by constructing a new root system for rational triple singularities and determine the number of roots for each rational triple singularity. Then we show that, for each root, we obtain a linear free divisor. So we obtain a new…
An aggregative composition is a binary operation obeying the principle that the whole is determined by the sum of its parts. The development of graph algebras, on which the theory of formal graph languages is built, relies on aggregative…
We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…
This is the second part of a series of three articles which introduce laminations for free groups (see math.GR/0609416 for the first part). Several definition of the dual lamination of a very small action of a free group on an $\R$-tree are…
A compacted binary tree is a graph created from a binary tree such that repeatedly occurring subtrees in the original tree are represented by pointers to existing ones, and hence every subtree is unique. Such representations form a special…
We find a family of planar bipartite graphs all of whose Lombardi drawings (drawings with circular arcs for edges, meeting at equal angles at the vertices) are nonplanar. We also find families of embedded series-parallel graphs and…
Skew-monoidal categories arise when the associator and the left and right units of a monoidal category are, in a specific way, not invertible. We prove that the closed skew-monoidal structures on the category of right R-modules are…
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 generalize and reprove an identity of Parker and Loday. It states that certain pairs of generating series associated to pairs of labelled rooted planar trees are mutually inverse under composition.