Related papers: Balanced binary trees in the Tamari lattice
We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…
Hex-trees are identified as a particular instance of weighted unary-binary trees. The Horton-Strahler numbers of these objects are revisited, and, thanks to a substitution that is not immediately intuitive, explicit results are possible.…
In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…
Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.
We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$. We give…
In this paper we demonstrate connections between three seemingly unrelated concepts. (1) The discrete isoperimetric problem in the infinite binary tree with all the leaves at the same level, $ {\mathcal T}_{\infty}$: The $n$-th edge…
In this article we define an encoding for parabolic permutations that distinguishes between parabolic $231$-avoiding permutations. We prove that the componentwise order on these codes realizes the parabolic Tamari lattice, and conclude a…
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…
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…
In analogy to other concepts of a similar nature, we define the inducibility of a rooted binary tree. Given a fixed rooted binary tree $B$ with $k$ leaves, we let $\gamma(B,T)$ be the proportion of all subsets of $k$ leaves in $T$ that…
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 first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…
We investigate relations between different width parameters of graphs, in particular balanced separator number, treewidth, and cycle rank. Our main result states that a graph with balanced separator number k has treewidth at least k but…
We give a characterization of equilibrium measures for $p$-capacities on the boundary of an infinite tree of arbitrary (finite) local degree. For $p=2$, this provides, in the special case of trees, a converse to a theorem of Benjamini and…
We describe an involution on Tamari intervals and m-Tamari intervals. This involution switches two sets of statistics known as the "rises" and the "contacts" and so proves an open conjecture from Pr\'eville-Ratelle on intervals of the…
Synchronization in networks of interconnected oscillators is a fascinating phenomenon that appear naturally in many independent fields of science and engineering. A substantial amount of work has been devoted to understanding all possible…
We investigate the structural relationship between prefix-free codes over the binary alphabet and a class of unlabeled rooted trees, which we call \emph{symmetric} trees. We establish a canonical correspondence between prefix-free codes and…
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…
We relate a balancing property of letters for bi-infinite sequences to the invariance of the resulting 1-dimensional tiling dynamics under changes in the lengths of the tiles. If the language of the sequence space is finitely balanced, then…
This is the first contribution of a sequence of papers introducing the notions of $s$-weak order and $s$-permutahedra, certain discrete objects that are indexed by a sequence of non-negative integers $s$. In this first paper, we concentrate…