Related papers: On the distance from a matrix polynomial to matrix…

Consider the Quadratic Assignment Problem (QAP): given two matrices A and D, minimize {trace AXDX^T: X is a permutation matrix}. New lower bounds were obtained recently (Mittelmann and peng [8]) for the QAP where D is either the Manhattan…

We compute the spectra of the adjacency matrices of the semi-regular polytopes. A few different techniques are employed: the most sophisticated, which relates the 1-skeleton of the polytope to a Cayley graph, is based on methods akin to…

A distance matrix $A \in \mathbb R^{n \times m}$ represents all pairwise distances, $A_{ij}=\mathrm{d}(x_i,y_j)$, between two point sets $x_1,...,x_n$ and $y_1,...,y_m$ in an arbitrary metric space $(\mathcal Z, \mathrm{d})$. Such matrices…

The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from…

We evaluate the dual cone of the set of diagonally dominant matrices (resp., scaled diagonally dominant matrices), namely ${\cal DD}_n^*$ (resp., ${\cal SDD}_n^*$), as an approximation of the semidefinite cone. We prove that the norm…

For a fixed singular modulus $\alpha$, we give an effective lower bound of norm of $x-\alpha$ for another singular modulus $x$ with large discriminant. We then generalize this result for $\Phi_m(x,\alpha)$, where $\Phi_m(X,Y) \in \Z[X,Y]$…

The subject of time-band-limiting, originating in signal processing, is dominated by the miracle that a naturally appearing integral operator admits a commuting differential one allowing for a numerically efficient way to compute its…

We provide a first systematic treatment of so-called rectangular multispectral perturbation theory. With their paper from 2003, Hochstenbach and Plestenjak ["Backward Error, Condition Numbers, and Pseudospectra for the Multiparameter…

We study the deviation inequality for the spectral norm of structured random matrices with non-gaussian entries. In particular, we establish an optimal bound for the $p$-th moment of the spectral norm by transfering the spectral norm into…

We give the first super-polynomial separation in the power of bounded-depth boolean formulas vs. circuits. Specifically, we consider the problem Distance $k(n)$ Connectivity, which asks whether two specified nodes in a graph of size $n$ are…

We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe…

In contemporary applied and computational mathematics, a frequent challenge is to bound the expectation of the spectral norm of a sum of independent random matrices. This quantity is controlled by the norm of the expected square of the…

We give an upper bound on the total variation distance between the linear eigenvalue statistic, properly scaled and centred, of a random matrix with a variance profile and the standard Gaussian random variable. The second order Poincar\'e…

We introduce an estimator for distances in a compact Riemannian manifold based on graph Laplacian estimates of the Laplace-Beltrami operator. We upper bound the error in the estimate of manifold distances, or more precisely an estimate of a…

Let $A$ be a $n\times n$ complex Hermitian matrix and let $\lambda(A)=(\lambda_1,\ldots,\lambda_n)\in \mathbb{R}^n$ denote the eigenvalues of $A$, counting multiplicities and arranged in non-increasing order. Motivated by problems arising…

We present a method to approximate pairwise distance on a graph, having an amortized sub-linear complexity in its size. The proposed method follows the so called heat method due to Crane et al. The only additional input are the values of…

The normalized distance Laplacian of a graph $G$ is defined as $\mathcal{D}^\mathcal{L}(G)=T(G)^{-1/2}(T(G)-\mathcal{D}(G))T(G)^{-1/2}$ where $\mathcal{D}(G)$ is the matrix with pairwise distances between vertices and $T(G)$ is the diagonal…

The higher rank numerical range is closely connected to the construction of quantum error correction code for a noisy quantum channel. It is known that if a normal matrix $A \in M_n$ has eigenvalues $a_1, \..., a_n$, then its higher rank…

Let $G$ be a connected uniform hypergraphs with maximum degree $\Delta$, spectral radius $\lambda$ and minimum H-eigenvalue $\mu$. In this paper, we give some lower bounds for $\Delta-\lambda$, which extend the result of [S.M. Cioab\u{a},…

Let $A = [a_{i j}]_{i,j=1}^n$ be a nonnegative matrix with $a_{1 1} = 0$. We prove some lower bounds for the spread $s(A)$ of $A$ that is defined as the maximum distance between any two eigenvalues of $A$. If $A$ has only two distinct…