Related papers: Trees and ultrametric M\"obius structures
A conformal structure on a manifold $M^n$ induces natural second order conformally invariant operators, called M\"obius and Laplace structures, acting on specific weight bundles of $M$, provided that $n\ge 3$. By extending the notions of…
A quasiconformal tree is a doubling (compact) metric tree in which the diameter of each arc is comparable to the distance of its endpoints. We show that for each integer $n\geq 2$, the class of all quasiconformal trees with uniform branch…
A few notes about infinite trees in a descriptive set-theoretic setting.
We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…
Ultrametric matrices have a rich structure that is not apparent from their definition. Notably, the subclass of strictly ultrametric matrices are covariance matrices of certain weighted rooted binary trees. In applications, these matrices…
In this paper, we study metric trees, without any finiteness restrictions. For subsets of such trees, a condition that guarantees that the Hausdorff and Gromov--Hausdorff distances from the subset to the entire metric tree are the same is…
By a geodesic subspace of a metric space $X$ we mean a subset $A$ of $X$ such that any two points in $A$ can be connected by a geodesic in $A$. It is easy to check that a geodesic metric space $X$ is an $\mathbb{R}$-tree (that is, a…
Let M be a manifold, and G a Lie group which satisfies the unique extension property. An (M,G) manifold N is a manifold endowed with an atlas (U_i,f_i) where f_i is a diffeomorphism between U_i and an open set of M such that the coordinates…
We study isometric actions of tree automorphism groups on the infinite-dimensional hyperbolic spaces. On the one hand, we exhibit a general one-parameter family of such representations and analyse the corresponding equivariant embeddings of…
We generalise the construction of infinite matroids from trees of matroids to allow the matroids at the nodes, as well as the field over which they are represented, to be infinite.
A metric space M is homogeneous if every isometry between finite subsets extends to a surjective isometry defined on the whole space. We show that if M is an ultrametric space, it suffices that isometries defined on singletons extend, i.e…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data-structures. Categorically, they arise as final coalgebras for polynomial…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
The early development of a zygote can be mathematically described by a developmental tree. To compare developmental trees of different species, we need to define distances on trees. If children cells after a division are not…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
We introduced the concept of a metric value set (MVS) in an earlier paper \cite{GM}. In this paper we study the algebraic structure of MVSs. For an MVS $M$ we define the concept of $M$-metrizability of a topological space and prove some…
In this paper we introduce a family of examples that can be regarded as spaces of nonpositive curvature, but with the distinct quality that they are not complete as metric spaces. This amounts to the fact that they are modelled on a finite…
Phrase structure trees have a hierarchical structure. In many subjects, most notably in Taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierarchical phrase trees are subject to a similar analysis, which…
We obtain several new characterizations of ultrametric spaces in terms of roundness, generalized roundness, strict p-negative type, and p-polygonal equalities (p > 0). This allows new insight into the isometric embedding of ultrametric…