Related papers: Spectral rigidity for primitive elements of $F_N$

We study projectional skeletons and the Plichko property in Lipschitz-free spaces, relating these concepts to the geometry of the underlying metric space. Specifically, we identify a metric property that characterizes the Plichko property…

We prove that the reconstruction of a certain type of length spaces from their travel time data on a closed subset is Lipschitz stable. The travel time data is the set of distance functions from the entire space, measured on the chosen…

We consider the Thompson-Stein group F(n_1,...,n_k) for integers n_1,...,n_k and k greater than 1. We highlight several differences between the cases k=1$ and k>1, including the fact that minimal tree-pair diagram representatives of…

We prove that the boundary of an orbit space or more generally a leaf space of a singular Riemannian foliation is an Alexandrov space in its intrinsic metric, and that its lower curvature bound is that of the leaf space. A rigidity theorem…

Density of Lipschitz functions in Newtonian spaces based on quasi-Banach function lattices is discussed. Newtonian spaces are first-order Sobolev-type spaces on abstract metric measure spaces defined via (weak) upper gradients. Our main…

We study a new bi-Lipschitz invariant \lambda(M) of a metric space M; its finiteness means that Lipschitz functions on an arbitrary subset of M can be linearly extended to functions on M whose Lipschitz constants are enlarged by a factor…

A distortion lower bound of $\Omega(\log(h)^{1/p})$ is proven for embedding the complete countably branching hyperbolic tree of height $h$ into a Banach space admitting an equivalent norm satisfying property $(\beta)$ of Rolewicz with…

We compute the Lipschitz-free spaces of subsets of the real line and characterize subsets of metric trees by the fact that their Lipschitz-free space is isometric to a subspace of $L_1$.

We construct a minimum tree for some boundary symmetric tetrahedra R^3, which has two nodes (interior points) with equal weights (positive numbers) having the property that the common perpendicular of some two opposite edges passes through…

Distances on merge trees facilitate visual comparison of collections of scalar fields. Two desirable properties for these distances to exhibit are 1) the ability to discern between scalar fields which other, less complex topological…

We establish tight bi-Lipschitz bounds certifying quasi-universality (universality up to a constant factor) for various distances between Reeb graphs: the interleaving distance, the functional distortion distance, and the functional…

We relate ergodic-theoretic properties of a very small tree or lamination to the behavior of folding and unfolding paths in Outer space that approximate it, and we obtain a criterion for unique ergodicity in both cases. Our main result is…

Let $A$ be a complex unital Banach algebra. Using a connection between the spectral distance and the growth characteristics of a certain entire map into $A$, we derive a generalization of Gelfand's famous Power Boundedness Theorem.…

Motivated from the study of eccentricity, center, and sum of eccentricities in graphs and trees, we introduce several new distance-based global and local functions based on the smallest distance from a vertex to some leaf (called the…

We provide explicit upper bounds for the eigenvalues of the Laplacian on a finite metric tree subject to standard vertex conditions. The results include estimates depending on the average length of the edges or the diameter. In particular,…

We characterize compact metric spaces whose locally flat Lipschitz functions separate points uniformly as exactly those that are purely 1-unrectifiable, resolving a problem of Weaver. We subsequently use this geometric characterization to…

Maximum parsimony distance is a measure used to quantify the dissimilarity of two unrooted phylogenetic trees. It is NP-hard to compute, and very few positive algorithmic results are known due to its complex combinatorial structure. Here we…

We solve a conjecture by Becker et al. (arXiv:2404.05963) on the topic of zero forcing regarding the number of minimal forts of a tree. They conjectured and we prove $\mathcal{F}_{T_n} \le \binom{n}{2} \mathcal{F}_{P_n}$ where…

It is shown that a minimum weight spanning tree of a finite ultrametric space can be always found in the form of path. As a canonical representing tree such path uniquely defines the whole space and, moreover, it has much more simple…

In this paper, we study the upper bounds for discrete Steklov eigenvalues on trees via geometric quantities. For a finite tree, we prove sharp upper bounds for the first nonzero Steklov eigenvalue by the reciprocal of the size of the…