相关论文: Uniformly continuous maps between ends of R-trees
Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…
We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has…
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.
In this paper we prove the equivalence of definitions for metric trees and for \delta-hyperbolic spaces. We point out how these equivalences can be used to understand the geometric and metric properties of \delta-hyperbolic spaces and its…
Topological behavior, such as chaos, irreducibility, and mixing of a one-sided shift of finite type, is well elucidated. Meanwhile, the investigation of multidimensional shifts, for instance, textile systems is difficult and only a few…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
Given a Lipschitz map $f$ from a cube into a metric space, we find several equivalent conditions for $f$ to have a Lipschitz factorization through a metric tree. As an application we prove a recent conjecture of David and Schul. The…
Metric embeddings are central to metric theory and its applications. Here we consider embeddings of a different sort: maps from a set to subsets of a metric space so that distances between points are approximated by minimal distances…
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…
We consider classes of arbitrary (finite or infinite) graphs of bounded shrub-depth, specifically the classes $\mathrm{TM}_r(d)$ of arbitrary graphs that have tree models of height $d$ and $r$ labels. We show that the graphs of…
We give a precise description of combed trees in terms of Kelly-Mac Lane graphs. We show that any combed tree is uniquely expressed as an allowable Kelly-Mac Lane graph of a certain shape. Conversely, we show that any such Kelly-Mac Lane…
In this work we study the interleaving distance between merge trees from a combinatorial point of view. We use a particular type of matching between trees to obtain a novel formulation of the distance. With such formulation, we tackle the…
In this paper we propose an approach for computing multiple high-quality near-isometric dense correspondences between a pair of 3D shapes. Our method is fully automatic and does not rely on user-provided landmarks or descriptors. This…
We show that the spaces of holomorphic and continuous maps from a smooth complex projective variety to a projective space have the same homology in a range depending on the degree of the maps.
We prove that if $M$ is an infinite complete metric space then the set of strongly norm-attaining Lipschitz functions $\SA(M)$ contains a linear subspace isomorphic to $c_0$. This solves an open question posed by V. Kadets and O. Rold\'an.
In this paper, we study the L\'{e}vy-Milman concentration phenomenon of 1-Lipschitz maps from mm-spaces to $\mathbb{R}$-trees. Our main theorems assert that the concentration to $\mathbb{R}$-trees is equivalent to the concentration to the…
We observe that the category of topological space, uniform spaces, and simplicial sets are all, in a natural way, full subcategories of the same larger category, namely the simplicial category of filters; this is, moreover, implicit in the…
A topological space is called a submetrizable if it can be mapped onto a metrizable topological space by a continuous one-to-one map. In this paper we answer two questions concerning sequence-covering maps on submetrizable spaces.
In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…
We show that if there exists a topologically expansive homeomorphism on a uniform space, then the space is always a regular space. Through examples we show that in general composition of topologically expansive homeomorphisms need not be…