Related papers: Tree metrics and their Lipschitz-free spaces
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 study a question of density of Lipschitz mappings in the Sobolev class of mappings from a closed manifold into a singular space. The main result of the paper shows that if we change the metric in the target space to a bi-Lipschitz…
For any integer $n$, we classify all trees whose $n$-path ideals have linear quotients.
Let $L$ be a fixed branch -- that is, an irreducible germ of curve -- on a normal surface singularity $X$. If $A,B$ are two other branches, define $u_L(A,B) := \dfrac{(L \cdot A) \: (L \cdot B)}{A \cdot B}$, where $A \cdot B$ denotes the…
We study multiplication operators on the weighted Banach spaces of an infinite tree. We characterize the bounded and the compact operators, as well as determine the operator norm. In addition, we determine the spectrum of the bounded…
Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…
We combine Kirchheim's metric differentials with Cheeger charts in order to establish a non-embeddability principle for any collection $\mathcal C$ of Banach (or metric) spaces: if a metric measure space $X$ bi-Lipschitz embeds in some…
In this paper motivated from subspace coding we introduce subspace-metric codes and subset-metric codes. These are coordinate-position independent pseudometrics and suitable for the folded codes. The half-Singleton upper bounds for linear…
We characterize $n$-rectifiable metric measure spaces as those spaces that admit a countable Borel decomposition so that each piece has positive and finite $n$-densities and one of the following: is an $n$-dimensional Lipschitz…
Given two Ahlfors-David regular sets in metric spaces, we study the question whether one of them has a subset bilipschitz equivalent with the other.
The problem of realizing finite metric spaces in terms of weighted graphs has many applications. For example, the mathematical and computational properties of metrics that can be realized by trees have been well-studied and such research…
In this article, we introduce the concept of lexicographic metric space and, after discussing some basic properties of these metric spaces, such as completeness, boundedness, compactness and separability, we obtain a formula for the metric…
The present paper deals with some structural properties of transportation cost spaces, also known as Arens-Eells spaces, Lipschitz-free spaces and Wasserstein spaces. The main results of this work are: (1) A necessary and sufficient…
L^p spaces of mappings taking values in arbitrary metric spaces, which we call nonlinear Lebesgue spaces, play an important role in several fields of mathematics. For instance, membership in these spaces is typically required for transport…
A natural metric on the space of all almost hermitian structures on a given manifold is investigated.
Tree-graded spaces are a generalization of $\mathbb{R}$-trees and play an important role in describing the large-scale geometry of relatively hyperbolic groups. We consider a subclass of tree-graded spaces that we call "disjointly…
Let $\mathbb{F}$ be the field of real Puiseux series and $\mathcal{T}_\mathbb{F}$ the $\mathbb{Q}$-tree defined by Brumfiel. We show that completing all the segments of $\mathcal{T}_\mathbb{F}$ does not result in a complete metric space.
We study the leaf-to-leaf distances on full and complete m-ary graphs using a recursive approach. In our formulation, leaves are ordered along a line. We find explicit analytical formulae for the sum of all paths for arbitrary leaf-to-leaf…
We find a new finite algorithm for evaluation of Lipschitz-free $p$-space norm in finite-dimensional Lipschitz-free $p$-spaces. We use this algorithm to deal with the problem of whether given $p$-metric spaces $N\subset M$, the canonical…
We consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also show that these sets are polyhedra. The latter result…