Related papers: Trees and ultrametric M\"obius structures
Consider observation data, comprised of n observation vectors with values on a set of attributes. This gives us n points in attribute space. Having data structured as a tree, implied by having our observations embedded in an ultrametric…
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…
Matrix configurations define noncommutative spaces endowed with extra structure including a generalized Laplace operator, and hence a metric structure. Made dynamical via matrix models, they describe rich physical systems including…
The Urysohn space is a separable complete metric space with two fundamental properties: (a) universality: every separable metric space can be isometrically embedded in it; (b) ultrahomogeneity: every finite isometry between two finite…
Nested (or reconciled) phylogenetic trees model co-evolutionary systems in which one evolutionary history is embedded within another. We introduce a geometric framework for such systems by defining $\sigma$-space, a moduli space of fully…
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…
In this article, the author proposes another way to define the completion of a metric space, which is different from the classical one via the dense property, and prove the equivalence between two definitions. This definition is based on…
This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…
We consider an infinite homogeneous tree $\mathcal V$ endowed with the usual metric $d$ defined on graphs and a weighted measure $\mu$. The metric measure space $(\mathcal V,d,\mu)$ is nondoubling and of exponential growth, hence the…
Urysohn constructed a separable complete universal metric space homogeneous for all finite subspaces, which is today called the Urysohn universal metric space. Some authors have recently investigated an ultrametric analogue of this space.…
We introduce a concept of tree-graded metric space and we use it to show quasi-isometry invariance of certain classes of relatively hyperbolic groups, to obtain a characterization of relatively hyperbolic groups in terms of their asymptotic…
We give a short and elementary proof of the fact that every metric space of finite asymptotic dimension can be embedded into a finite product of trees.
A metric space $X$ is rigid if the isometry group of $X$ is trivial. The finite ultrametric spaces $X$ with $|X| \geq 2$ are not rigid since for every such $X$ there is a self-isometry having exactly $|X|-2$ fixed points. Using the…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain…
We introduced the concept of a metric value set (MVS) in an earlier paper \cite{GM} and developed the idea further in \cite{AS}. In this paper we study locally $M$-metrizable spaces and the products of $M$-metrizable spaces. Finally we…
We introduce a new definition of nonpositive curvature in metric spaces and study its relationship to the existing notions of nonpositive curvature in comparison geometry. The main feature of our definition is that it applies to all metric…
We investigate properties which remain invariant under the action of quasi-M\"obius maps of quasi-metric spaces. A metric space is called doubling with constant D if every ball of finite radius can be covered by at most D balls of half the…
An infinite dimensional notion of asymptotic structure is considered. This notion is developed in terms of trees and branches on Banach spaces. Every countably infinite countably branching tree $\mathcal T$ of a certain type on a space X is…
We provide an $O(n \log n)$ algorithm computing the linear maximum induced matching width of a tree and an optimal layout.
We define an odometer in the Baire space. That is the non-compact space of one sided sequences of natural numbers. We go on to prove that it is topologically conjugated to the dyadic odometer restricted to an appropriate non-compact subset…