Related papers: An analogue of the plactic monoid for binary searc…
In this paper we introduce novel views of monoids and groups. More specifically, for a given set $S$, let $S^{S\times S}$ be the set of binary operations on $S$. We equip $S^{S\times S}$ with canonical binary operations induced by the…
This paper introduces the braidings of dendriform algebras and tridendriform algebras. By studying free braided dendriform algebras, we obtain braidings of the Hopf algebras of Loday and Ronco of planar binary rooted trees. We also give a…
In this work we consider monoids as algebras with an associative binary operation and the nullary operation that fixes the identity element. We found an example of two varieties of monoids with finite subvariety lattices such that their…
To a univariate monic polynomial is attached a special planar forest that is called the picture of the polynomial. Isotopy classes of pictures are called signatures. All combinatorially possible signatures are realized and spaces of…
A common framework is provided that comprises classical ordinal item response models as the cumulative, sequential and adjacent categories models as well as nominal response models and item response tree models. The taxonomy is based on the…
We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar…
We show that any normal algebraic monoid is an extension of an abelian variety by a normal affine algebraic monoid. This extends (and builds on) Chevalley's structure theorem for algebraic groups.
Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the…
In this note, by counting some colored plane trees we obtain several binomial identities. These identities can be viewed as specific evaluations of certain generalizations of the Narayana polynomials. As consequences, it provides…
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…
We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…
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 present a binary tree that describes the 2-adic valuation of a sequence of coefficients arising from the evaluation of a rational integral.
Layered monoidal theories provide a categorical framework for studying scientific theories at different levels of abstraction, via string diagrammatic algebra. We introduce models for three closely related classes of layered monoidal…
We construct a quasi-Garside monoid structure for the free group. This monoid should be thought of as a dual braid monoid for the free group, generalising the constructions by Birman-Ko-Lee and by the author of new Garside monoids for Artin…
In categorical realizability, it is common to construct categories of assemblies and categories of modest sets from applicative structures. These categories have structures corresponding to the structures of applicative structures. In the…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
We show that the subgraph induced in Young's graph by the set of partitions with an odd number of standard Young tableaux is a binary tree. This tree exhibits self-similarities at all scales, and has a simple recursive description.
We complete the classification of algebraic monoid structures on the affine 3-space. The result is based on a reduction of the general case to that of commutative monoids. We also study various algebraic properties of all monoids appearing…
We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…