Related papers: Foata's Bijection for Tree-Like Structures

The Baxter number can be written as $B_n = \sum_0^n \Theta_{k,n-k-1}$. These numbers have first appeared in the enumeration of so-called Baxter permutations; $B_n$ is the number of Baxter permutations of size $n$, and $\Theta_{k,l}$ is the…

Let $R$ be a two-dimensional regular local ring. In this paper, we prove that there is a bijection between the set of all valuations of $Quot(R)$ centered at $R$ and valuations of $k(x,y)$ centered at $k[x,y]_{(x,y)}$, where $k$ is the…

We study the portraits of isometries of rooted trees - the labelling of the tree, at each vertex, by the permutation of its descendants - in terms of languages. We characterize regularly branched self-similar groups in terms of…

Topological phylogenetic trees can be assigned edge weights in several natural ways, highlighting different aspects of the tree. Here the rooted triple and quartet metrizations are introduced, and applied to formulate novel fast methods of…

We present a bijective proof for the planar case of Louf's counting formula on bipartite planar maps with prescribed face degree, that arises from the Toda hierarchy. We actually show that his formula hides two simpler formulas, both of…

Consider the following process on a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in some preceding edge. The resulting set of edges forms a…

A celebrated result of Bousquet-M\'elou and Jehanne states that the bivariate power series solutions of so-called combinatorial polynomial equations with one catalytic variable, also known as catalytic equations, are algebraic series. We…

We study decreasing binary trees in which every vertex with two children is colored red or blue. We construct two bijections. The first, to ordered set partitions into odd-sized blocks each arranged as an alternating permutation, shows that…

It is proved that the restriction of a $k$ and $(k-1)$-component directed spanning forest of minimal weight to an atom of the subset algebra generated by the sets of vertices of trees of $k$-component minimal spanning forests is a tree. For…

We show that if G is a finite group and f is a {0,1}-valued function on G with Fourier algebra norm at most M then f may be computed by a coset decision tree (that is a decision tree in which at each vertex we query membership of a given…

We provide a description of the structure of $\aleph_0$-categorical trees and cycle-free partial orders. First the maximal branches of $\aleph_0$-categorical tree are examined, followed by the configuration of the ramification orders, which…

Inspired by the Stochastic processes described by the Feller Coupling and Chinese Restaurant Processes, we create four different bijections from words in the set $[1]\times [2] \times\cdot \times[n]$ to $S_n$. We then compose these maps…

We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the…

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

A string-like compact data structure for unlabelled rooted trees is given using 2n bits.

Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…

The Ward numbers $W(n,k)$ combinatorially enumerate set partitions with block sizes $\geq 2$ and phylogenetic trees (total partition trees). We prove that $W(n,k)$ also counts \emph{increasing Schr\"oder trees} by verifying they satisfy…

Billey et al. [arXiv:1507.04976] have recently discovered a surprisingly simple formula for the number $a_n(\sigma)$ of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) with $n\geq 1$ leaves, fixed (for the…

This is a short exposition--mostly by way of the toy models ``double logarithm'' and ``triple logarithm''--which should serve as an introduction to a forthcoming article in which we establish a connection between multiple polylogarithms,…

Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…