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

An approximate Steiner tree is a Steiner tree on a given set of terminals in Euclidean space such that the angles at the Steiner points are within a specified error e from 120 degrees.This notion arises in numerical approximations of…

It is shown that if a metric space exhibits certain finiteness and tree-like properties, then elements of its group of bounded displacement which are infinitely divisible are also torsion. This extends a result of N. M. Suchkov, A. A.…

We study the Lipschitz metric on Outer Space and prove that fully irreducible elements of Out(F_n) act by hyperbolic isometries with axes which are strongly contracting. As a corollary, we prove that the axes of fully irreducible…

In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)=1/1^3+1/2^3+1/3^3+... as n goes to infinity. We consider…

The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…

A proof for the lower bound is provided for the smallest eigenvalue of finite element equations with arbitrary conforming simplicial meshes. The bound has a similar form as the one by Graham and McLean [SIAM J. Numer. Anal., 44 (2006), pp.…

The article [HPS] established a monotonicity inequality for the Helmholtz equation and presented applications to shape detection and local uniqueness in inverse boundary problems. The monotonicity inequality states that if two scattering…

Using uniformization, Cantor type sets can be regarded as boundaries of rooted trees. In this setting, we show that the trace of a first-order Sobolev space on the boundary of a regular rooted tree is exactly a Besov space with an explicit…

Motivated by the local theory of Banach spaces we introduce a notion of finite representability for metric spaces. This allows us to develop a new technique for comparing the generalized roundness of metric spaces. We illustrate this…

We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…

We generalize Schwenk's result that almost all trees contain any given limb to trees with positive integer vertex weights. The concept of characteristic polynomial is extended to such weighted trees and we prove that the proportion of…

We introduce the notion of metric semilattice on the metric space and prove the criterion of $\R$-tree as connected geodesic metric space $X$ admitting the partial order, such that $X$ is semilinear metric semilattice. Also we state the…

Kirchoff's matrix tree theorem of 1847 connects the number of spanning trees of a graph to the spectral determinant of the discrete Laplacian [22]. Recently an analogue was obtained for quantum graphs relating the number of spanning trees…

A finite set of unlabelled points in Euclidean space is the simplest representation of many real objects from mineral rocks to sculptures. Since most solid objects are rigid, their natural equivalence is rigid motion or isometry maintaining…

Given a bounded open set $\Omega$ in $\mathbb{R}^n$ (or a compact Riemannian manifold with boundary), and a partition of $\Omega$ by $k$ open sets $\omega_j$, we consider the quantity $\max_j \lambda(\omega_j)$, where $\lambda(\omega_j)$ is…

We consider the minimization of the NLS energy on a metric tree, either rooted or unrooted, subject to a mass constraint. With respect to the same problem on other types of metric graphs, several new features appear, such as the existence…

In the present paper we show how one can calculate the lengths of edges of a minimum spanning tree constructed for a finite metric space, in terms of the Gromov-Hausdorff distances from this space to simplices of sufficiently large…

We give a formalism for approximate isomorphism in continuous logic simultaneously generalizing those of two papers by Ben Yaacov and by Ben Yaacov, Doucha, Nies, and Tsankov, which are largely incompatible. With this we explicitly exhibit…

We consider additive functionals $X_n(\phi)$ with small toll functions on split trees and a generalization of split trees, which we call fractional split trees, where the split vector does not need to sum up to 1. These additive functionals…

In the first part of this paper we show that a set $E$ has locally finite $s$-perimeter if and only if it can be approximated in an appropriate sense by smooth open sets. In the second part we prove some elementary properties of local and…