相关论文: On the distance from a matrix polynomial to matrix…

We investigate the representation of the geometrical information of the universe in terms of the eigenvalues of the Laplacian defined on the universe. We concentrate only on one specific problem along this line: To introduce a concept of…

Let $G$ be a connected graph with vertex set $V$. The distance, $d_G(u, v)$, between vertices $u$ and $v$ of $G$ is defined as the length of a shortest path between $u$ and $v$ in $G$. The distance matrix of $G$ is the matrix $\mathbf{D}(G)…

In this paper, we consider self-adjoint difference equations of the form -\Delta(a_{n-1}\Delta y_{n-1})+b_{n}y_{n}=\lambda y_{n},n=0,1,...\label{eq:abstract} where $a_{n-1}>0$ for all $n\ge0$ and $b_{n}$ are real and $\lambda$ is complex.…

We give the characteristic polynomial of the distance or adjacency matrix of the strong power graph of a finite group, and compute its distance and adjacency spectrum.

First, we extend the results of approximate matrix multiplication from the Frobenius norm to the spectral norm. Second, We develop a class of fast approximate generalized linear regression algorithms with respect to the spectral norm.…

Let A be an n x n symmetric random matrix whose upper-triangular entries are independent and follow possibly non-identical subgaussian distributions. This paper investigates the spectral properties of A, including its eigenvalues and…

Constructing quantum LDPC codes with a minimum distance that grows faster than a square root of the length has been a major challenge of the field. With this challenge in mind, we investigate constructions that come from high-dimensional…

Many complex systems can be reduced to their key components through spectrally decomposing matrices that capture their dynamics. These matrices can in turn be constructed from data, often by least-squares fitting: examples of algorithms to…

Let $\Gamma$ be a distance-regular graph with diameter $d$ and Kneser graph $K=\Gamma_d$, the distance-$d$ graph of $\Gamma$. We say that $\Gamma$ is partially antipodal when $K$ has fewer distinct eigenvalues than $\Gamma$. In particular,…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

We show a simple method for constructing larger matrices but preserving the spectral radius. This yields a sufficient criteria for two square matrices of arbitrary dimension have the same spectral radius, a way to compare spectral radii of…

Let $G$ be a connected graph with order $n$ and size $m$. Let $D(G)$ and $Tr(G)$ be the distance matrix and diagonal matrix with vertex transmissions of $G$, respectively. For any real $\alpha\in[0,1]$, the generalized distance matrix…

Let $G$ be a connected simple graph with $n$ vertices. The distance Laplacian matrix $D^{L}(G)$ is defined as $D^L(G)=Diag(Tr)-D(G)$, where $Diag(Tr)$ is the diagonal matrix of vertex transmissions and $D(G)$ is the distance matrix of $G$.…

Given a square complex matrix $A$, we tackle the problem of finding the nearest matrix with multiple eigenvalues or, equivalently when $A$ had distinct eigenvalues, the nearest defective matrix. To this goal, we extend the general framework…

In this paper, we study the relative perturbation bounds for joint eigenvalues of commuting tuples of normal $n \times n$ matrices. Some Hoffman-Wielandt type relative perturbation bounds are proved using the Clifford algebra technique. A…

We consider the bifurcation problem u'' + \lambda u = N(u) with two point boundary conditions where N(u) is a general nonlinear term which may also depend on the eigenvalue \lambda. A new derivation of a variational principle for the lowest…

A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we present an explicit formula for computing the distance characteristic polynomial of a threshold graph from its binary sequence. As application, we…

Computation of the interleaving distance between persistence modules is a central task in topological data analysis. For $1$-parameter persistence modules, thanks to the isometry theorem, this can be done by computing the bottleneck…

We show that the mixed discriminant of $n$ positive semidefinite $n \times n$ real symmetric matrices can be approximated within a relative error $\epsilon >0$ in quasi-polynomial $n^{O(\ln n -\ln \epsilon)}$ time, provided the distance of…

Let $\Gamma_n$ be an $n\times n$ Haar-invariant orthogonal matrix. Let $ Z_n$ be the $p\times q$ upper-left submatrix of $\Gamma_n,$ where $p=p_n$ and $q=q_n$ are two positive integers. Let $G_n$ be a $p\times q$ matrix whose $pq$ entries…