Related papers: Squared distance matrices of trees with matrix wei…
We develop a general framework for reasoning about distances between transition systems with quantitative information. Taking as starting point an arbitrary distance on system traces, we show how this leads to natural definitions of a…
We present the first combinatorial proof of the Graham-Pollak Formula for the determinant of the distance matrix of a tree, via sign-reversing involutions and the Lindstr\"om-Gessel-Viennot Lemma. Our approach provides a cohesive and…
In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…
Given a tree of weighted vertices, it is sometimes possible to break the tree into two equally-weighted subtrees within an allowable error. We give a fast algorithm that finds an edge which breaks the tree into equal-weight components or…
We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…
Let $A$ be a positive semidefinite $m\times m$ block matrix with each block $n$-square, then the following determinantal inequality for partial traces holds \[ (\mathrm{tr} A)^{mn} - \det(\mathrm{tr}_2 A)^n \ge \bigl| \det A -…
Let $\mathbb{F}_p$ be a prime field, and ${\mathcal E}$ a set in $\mathbb{F}_p^2$. Let $\Delta({\mathcal E})=\{||x-y||: x,y \in {\mathcal E} \}$, the distance set of ${\mathcal E}$. In this paper, we provide a quantitative connection…
A metric phylogenetic tree relating a collection of taxa induces weighted rooted triples and weighted quartets for all subsets of three and four taxa, respectively. New intertaxon distances are defined that can be calculated from these…
Computing the Fr\'{e}chet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fr\'{e}chet distance for a…
An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.
Suppose N is a phylogenetic network indicating a complicated relationship among individuals and taxa. Often of interest is a much simpler network, for example, a species tree T, that summarizes the most fundamental relationships. The…
It is a classical result that an unrooted tree $T$ having positive real-valued edge lengths and no vertices of degree two can be reconstructed from the induced distance between each pair of leaves. Moreover, if each non-leaf vertex of $T$…
Every finite metric tree has generalized roundness strictly greater than one. On the other hand, some countable metric trees have generalized roundness precisely one. The purpose of this paper is to identify some large classes of countable…
Computing the rotation distance between two binary trees with $n$ internal nodes efficiently (in $poly(n)$ time) is a long standing open question in the study of height balancing in tree data structures. In this paper, we initiate the study…
The crossing matrix of a braid on $N$ strands is the $N\times N$ integer matrix with zero diagonal whose $i,j$ entry is the algebraic number (positive minus negative) of crossings by strand $i$ over strand $j$ . When restricted to the…
If $S$ is a given regular $d$-simplex of edge length $a$ in the $d$-dimensional Euclidean space $\mathcal{E}$, then the distances $t_1$, $\cdots$, $t_{d+1}$ of an arbitrary point in $\mathcal{E}$ to the vertices of $S$ are related by the…
We study the differential and metric structures of the set of real square roots of a non-singular real matrix, under the assumption that the matrix and its square roots are semi-simple, or symmetric, or orthogonal.
The square of a connected graph $G$ is obtained from $G$ by adding an edge between every pair of vertices at distance $2$. In this paper we give some upper or lower bounds for the spectral radius of the square of connected graphs, trees and…
The generalized distance matrix of a graph is a matrix in which the $(i,j)$th entry is a function, $f$, of the distance between vertex $i$ and vertex $j$. Depending on the choice of $f$, this family of matrices includes both the adjacency…
Let $T$ be a tree. Suppose $\lambda$ is an eigenvalue of the Laplacian matrix of $T$ with multiplicity $m_{T}(\lambda)$. It is known that $m_{T}(\lambda) \leq p(T)-1$, where $p(T)$ is the number of pendant vertices of $T$. In this paper, we…