Related papers: Orphans in Forests of Linear Fractional Transforma…
We study random typical minimal factorizations of the $n$-cycle into transpositions, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions. By viewing transpositions as chords of the unit disk and by reading them…
We find a duality between two well-known trees, the Calkin-Wilf tree and the Stern-Brocot tree, derived from cluster algebra theory. The vertex sets of these trees are the set of rational numbers, and they have cluster structures induced by…
We study several enumeration problems connected to linear trees, a broad class which includes stars, paths, generalized stars, and caterpillars. We provide generating functions for counting the number of linear trees on $n$ vertices,…
We consider a class of Crump-Mode-Jagers processes with interaction, constructed by removing a newly born offspring with a probability that depends on the age structure of the population at its birth time. We prove a law of large numbers…
In this paper, we show that a Galton-Watson tree conditioned to have a fixed number of particles in generation $n$ converges in distribution as $n\rightarrow\infty$, and with this tool we study the span and gap statistics of a branching…
In this note we discuss trees similar to the Calkin-Wilf tree, a binary tree that enumerates all positive rational numbers in a simple way. The original construction of Calkin and Wilf is reformulated in a more algebraic language, and an…
Phylogenetic networks are used in biology to represent evolutionary histories. The class of orchard phylogenetic networks was recently introduced for their computational benefits, without any biological justification. Here, we show that…
We introduce and study a new notion of patterns in Stirling and $k$-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns…
We observe that a standard transformation between \emph{ordinal} trees (arbitrary rooted trees with ordered children) and binary trees leads to interesting succinct binary tree representations. There are four symmetric versions of these…
In this article, we prove various properties of Calkin-Wilf tree. We also see how the Minkowski question mark function will act on Calkin-Wilf tree and its diagonals.
The analysis of objects living on ultrametric trees, in particular the block-diagonalization of 4-replica matrices $M^{\alpha \beta ; \gamma \delta}$, is shown to be dramatically simplified through the introduction of properly chosen…
Phylogenetic networks are an extension of phylogenetic trees that allow for the representation of reticulate evolution events. One of the classes of networks that has gained the attention of the scientific community over the last years is…
We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…
Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…
We consider branching random walks built on Galton--Watson trees with offspring distribution having a bounded support, conditioned to have $n$ nodes, and their rescaled convergences to the Brownian snake. We exhibit a notion of ``globally…
To further develop the statistical inference problem for heterogeneous treatment effects, this paper builds on Breiman's (2001) random forest tree (RFT)and Wager et al.'s (2018) causal tree to parameterize the nonparametric problem using…
In this paper we consider a refinement, due to Nathanson, of the Calkin-Wilf tree. In particular, we study the properties of such trees associated with the matrices $L_u=\begin{bmatrix} 1 & 0 \\ u & 1\end{bmatrix}$ and $R_v=\begin{bmatrix}…
Galled trees are studied as a recombination model in population genetics. This class of phylogenetic networks is generalized into tree-child, galled and reticulation-visible network classes by relaxing a structural condition imposed on…
Theoretical background and an implementation of the (p)-group generation algorithm by Newman and O'Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite…
We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and…