Related papers: Increasing Binary Trees and the $(\alpha,\beta)$-E…
We show that any convergent (shuffle) arborified zeta value admits a series representation. This justifies the introduction of a new generalisation to rooted forests of multiple zeta values, and we study its algebraic properties. As a…
An increasing 1,2-tree is a labeled graph formed by starting with a vertex and then repeatedly attaching a leaf to a vertex or a triangle to an edge, the labeling of the vertices corresponding to the order in which the vertices are added.…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…
We study polynomial identities of nonassociative algebras constructed by using infinite binary words and their combinatorial properties. Infinite periodic and Sturmian words were first applied for constructing examples of algebras with…
We consider matrices with entries that are polynomials in $q$ arising from natural $q$-generalisations of two well-known formulas that count: forests on $n$ vertices with $k$ components; and trees on $n+1$ vertices where $k$ children of the…
We develop basic cluster theory from an elementary point of view using a variation of binary trees which we call mixed cobinary trees. We show that the number of isomorphism classes of such trees is given by the Catalan number Cn where n is…
We develop a tree boosting algorithm for collider measurements of multiple Wilson coefficients in effective field theories describing phenomena beyond the standard model of particle physics. The design of the discriminant exploits per-event…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yields a new formula for the number of NATs. We also obtain…
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…
We give an explicit combinatorial proof of a weighted version of strong log-concavity for the generating polynomial of increasing spanning forests of a finite simple graph equipped with a total ordering of the vertices. In contrast to…
In this work, two new series expansions for generalized Euler's constants (Stieltjes constants) $\gamma_m$ are obtained. The first expansion involves Stirling numbers of the first kind, contains polynomials in $\pi^{-2}$ with rational…
The tangent number $T_{2n+1}$ is equal to the number of increasing labelled complete binary trees with $2n+1$ vertices. This combinatorial interpretation immediately proves that $T_{2n+1}$ is divisible by $2^n$. However, a stronger…
In \cite{TallaWaffo2025arxiv2511.02843} we introduced even polynomials $\Xi_n,\Lambda_n\in\mathbb{Q}[x]$ arising from integral representations of $\beta(2n)/\pi^{2n-1}$ and $\zeta(2n+1)/\pi^{2n}$. In this paper we give explicit closed…
This thesis comes within the scope of algebraic combinatorics and studies problems related to three orders on permutations: the two said weak orders (right and left) and the strong order or Bruhat order. The first part deals with bases of…
We prove a weighted generalization of the formula for the number of plane vertex-labeled trees.
The Eulerian transformation is the linear operator on polynomials in one variable with real coefficients which maps the powers of this variable to the corresponding Eulerian polynomials. The derangement transformation is defined similarly.…
We introduce a correspondence between phylogenetic trees and Brauer diagrams, inspired by links between binary trees and matchings described by Diaconis and Holmes (1998). This correspondence gives rise to a range of semigroup structures on…
In [Dugan-Glennon-Gunnells-Steingrimsson-2019], the authors introduce tiered trees to define combinatorial objects counting absolutely indecomposable representations of certain quivers, and torus orbits on certain homogeneous varieties. In…
Joyal's theory of combiantorial species provides a rich and elegant framework for enumerating combinatorial structures by translating structural information into algebraic functional equations. We present some classical and folklore results…