Related papers: Finite Ultrametric Balls

The goal of this work is to decompose random populations with a genealogy in subfamilies of a given degree of kinship and to obtain a notion of infinitely divisible genealogies. We model the genealogical structure of a population by…

Finding the number of maximal subgroups of infinite index of a finitely generated group is a natural problem that has been solved for several classes of `geometric' groups (linear groups, hyperbolic groups, mapping class groups, etc). Here…

A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal…

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

The paper studies a class of variational problems, modeling optimal shapes for tree roots. Given a measure $\mu$ describing the distribution of root hair cells, we seek to maximize a harvest functional $\mathcal{H}$, computing the total…

Given a distance matrix consisting of pairwise distances between species, a distance-based phylogenetic reconstruction method returns a tree metric or equidistant tree metric (ultrametric) that best fits the data. We investigate…

We consider a family of distributions on which natural tail orders can be constructed upon a representation of a distribution by a (single) hyper-real number. Past research revealed that the ordering can herein strongly depend on the…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

Given any infinite tree in the plane satisfying certain topological conditions, we construct an entire function $f$ with only two critical values $\pm 1$ and no asymptotic values such that $f^{-1}([-1,1])$ is ambiently homeomorphic to the…

Let ${\cal T}=(T,w)$ be a weighted finite tree with leaves $1,..., n$. For any $I :=\{i_1,..., i_k \} \subset \{1,...,n\}$, let $D_I ({\cal T})$ be the weight of the minimal subtree of $T$ connecting $i_1,..., i_k$; the $D_{I} ({\cal T})$…

We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for…

Any unital separable continuous C(X)-algebra with properly infinite fibres is properly infinite as soon as the compact Hausdorff space X has finite topological dimension. We study conditions under which this is still the case in the…

Phylogenetic tree shapes capture fundamental signatures of evolution. We consider ``ranked'' tree shapes, which are equipped with a total order on the internal nodes compatible with the tree graph. Recent work has established an elegant…

We study the Hausdorff and the box dimensions of closed invariant subsets of the space of pointed trees, equipped with a pseudogroup action. This pseudogroup dynamical system can be regarded as a generalization of a shift space. We show…

Let $L$ be a fixed branch -- that is, an irreducible germ of curve -- on a normal surface singularity $X$. If $A,B$ are two other branches, define $u_L(A,B) := \dfrac{(L \cdot A) \: (L \cdot B)}{A \cdot B}$, where $A \cdot B$ denotes the…

A metric space $\mathcal{T}$ is a \emph{real tree} if for any pair of points $x, y \in \mathcal{T}$ all topological embeddings $\sigma$ of the segment $[0,1]$ into $\mathcal{T}$, such that $\sigma (0)=x$ and $\sigma (1)=y$, have the same…

Let $n\geq 2$. In this paper, we obtain approximation properties of various families of normalized univalent mappings $f$ on the Euclidean unit ball $\mathbb{B}^n$ in $\mathbb{C}^n$ by automorphisms of $\mathbb{C}^n$ whose restrictions to…

We study random unrooted plane trees with $n$ vertices sampled according to the weights corresponding to the vertex-degrees. Our main result shows that if the generating series of the weights has positive radius of convergence, then this…

We consider groups $\mathbb{I}$ of isometries of ultrametric Urysohn spaces $\mathbb{U}$. Such spaces $\mathbb{U}$ admit transparent realizations as boundaries of certain $R$-trees and the groups $\mathbb{I}$ are groups of automorphisms of…

Given a set S of n \geq d points in general position in R^d, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree…