Related papers: Universal quasiconformal trees

We define generic ensembles of infinite trees. These are limits as $N\to\infty$ of ensembles of finite trees of fixed size $N$, defined in terms of a set of branching weights. Among these ensembles are those supported on trees with vertices…

There are several good reasons you might want to read about uniform spanning trees, one being that spanning trees are useful combinatorial objects. Not only are they fundamental in algebraic graph theory and combinatorial geometry, but they…

This paper demonstrates that every ultrametric space is homeomorphic to a clade space of a pruned tree, i.e., a subspace of a tree's canopy. Furthermore, it characterizes several topological properties of ultrametrizable spaces through the…

We survey the emerging area of compression-based, parameter-free, similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extraction. Given a family of distances on a set of objects, a…

The Subtree Isomorphism problem asks whether a given tree is contained in another given tree. The problem is of fundamental importance and has been studied since the 1960s. For some variants, e.g., ordered trees, near-linear time algorithms…

A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As a quasisymmetric analogue, we conjecture that the chromatic quasisymmetric function of Shareshian and Wachs and of Ellzey distinguishes…

The coarse similarity class $[A]$ of $A$ is the set of all $B$ whose symmetric difference with $A$ has asymptotic density 0. There is a natural metric $\delta$ on the space $\mathcal{S}$ of coarse similarity classes defined by letting…

In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…

A {$t$-stretch tree cover} of a metric space $M = (X,\delta)$, for a parameter $t \ge 1$, is a collection of trees such that every pair of points has a $t$-stretch path in one of the trees. Tree covers provide an important sketching tool…

We introduce an ensemble of infinite causal triangulations, called the uniform infinite causal triangulation, and show that it is equivalent to an ensemble of infinite trees, the uniform infinite planar tree. It is proved that in both cases…

In this paper we present with algebraic trees a novel notion of (continuum) trees which generalizes countable graph-theoretic trees to (potentially) uncountable structures. For that purpose we focus on the tree structure given by the branch…

In this article, we introduce and investigate the concept of partial quasi-metric type space as a generalization of both partial quasi-metric and quasi-metric type spaces. We show that many important constructions studied in K\"unzi's…

We investigate the interrelations between the metric properties, order properties and combinatorial properties of the set of balls in totally bounded ultrametric space. In particular, the Gurvich-Vyalyi representation of finite, ultrametric…

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…

A word is quasiperiodic (or coverable) if it can be covered with occurrences of another finite word, called its quasiperiod. A word is multi-scale quasiperiodic (or multi-scale coverable) if it has infinitely many different quasiperiods.…

We prove that each infinite 2-group with a unique 2-element subgroup is isomorphic either to the quasicyclic 2-group or to the infinite group of generalized quaternions.

We study a quasisymmetric version of the classical Koebe uniformization theorem in the context of Ahlfors regular metric surfaces. In particular, we prove that an Ahlfors 2-regular metric surface X homeomorphic to a finitely connected…

This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes…

Well-quasi orders such as homeomorphic embedding are commonly used to ensure termination of program analysis and program transformation, in particular supercompilation. We compare eight well-quasi orders on how discriminative they are and…

This article is the introductory part of authors PhD thesis. The article presents a new coordinate invariant definition of quasiregular and quasiconformal mappings on Riemannian manifolds that generalizes the definition of quasiregular…