Related papers: Universal tree-graded spaces and asymptotic cones

A thorough classification of the topologies of compact homogeneous universes is given except for the hyperbolic spaces, and their global degrees of freedom are completely worked out. To obtain compact universes, spatial points are…

We show that if a group G acts isometrically on a locally finite leafless R-tree inducing a two-transitive action on its ends, then this tree is determined by the action of G on the boundary. As a corollary we obtain that locally finite…

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…

This paper provides a fixed point theorem and iterative construction of a common fixed point for a general class of nonlinear mappings in the setup of uniformly convex hyperbolic spaces. We translate a multi-step iteration, essentially due…

Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…

A metric space is said to be all-set-homogeneous if any of its partial isometries can be extended to a genuine isometry. We give a classification of a certain subclass of all-set-homogeneous length spaces.

Sormani and Wei proved in 2004 that a compact geodesic space has a categorical universal cover if and only if its covering/critical spectrum is finite. We add to this several equivalent conditions pertaining to the geometry and topology of…

Given any regularly varying dislocation measure, we identify a natural self-similar fragmentation tree as scaling limit of discrete fragmentation trees with unit edge lengths. As an application, we obtain continuum random tree limits of…

We give a complete criterion for when two hyperbolic automorphisms of a tree generate a free, discrete subgroup. The decision depends only on three geometric invariants: the translation lengths of the generators and the length of overlap of…

To each sequence $(a_n)$ of positive real numbers we associate a growing sequence $(T_n)$ of continuous trees built recursively by gluing at step $n$ a segment of length $a_n$ on a uniform point of the pre-existing tree, starting from a…

A topological space is nonseparably connected if it is connected but all of its connected separable subspaces are singletons. We show that each connected first countable space is the image of a nonseparably connected complete metric space…

We say that a finitely generated group $G$ has property (QT) if it acts isometrically on a finite product of quasi-trees so that orbit maps are quasi-isometric embeddings. A quasi-tree is a connected graph with path metric quasi-isometric…

A phylogenetic tree is an acyclic graph with distinctly labeled leaves, whose internal edges have a positive weight. Given a set of n leaves, the collection of all phylogenetic trees with this leaf set can be assembled into a metric cube…

We give a complete characterization of the locally compact groups that are non-elementary Gromov-hyperbolic and amenable. They coincide with the class of mapping tori of discrete or continuous one-parameter groups of compacting…

It is well known that the Tits boundary of a proper cocompact CAT(0) space embeds into every asymptotic cone of the space. We explore the relationships between the asymptotic cones of a CAT(0) space and its boundary under both the standard…

We consider splittings of groups over finite and two-ended subgroups. We study the combinatorics of such splittings using generalisations of Whitehead graphs. In the case of hyperbolic groups, we relate this to the topology of the boundary.…

We describe the class of graphs for which all metric spaces with diametrical graphs belonging to this class are ultrametric. It is shown that a metric space $(X, d)$ is ultrametric iff the diametrical graph of the metric $d_{\varepsilon}(x,…

Asymptotic cones of metric spaces were first invented by Gromov. They are metric spaces which capture the 'large-scale structure' of the underlying metric space. Later, van den Dries and Wilkie gave a more general construction of asymptotic…

For a tree $T$, we show that for many positive integer values of $n$, and an integer $s \geq 2$, the higher topological complexity $TC_s$ of the unordered configuration spaces of trees $U\mathcal{C}^nT$, is maximal. In other words, we prove…

We present a systematic investigation into how tree-decompositions of finite adhesion capture topological properties of the space formed by a graph together with its ends. As main results, we characterise when the ends of a graph can be…