Related papers: Inverse Spectral Problems for Linked Vibrating Sys…

The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…

The integrable structure of Ginibre's Orthogonal Ensemble of random matrices is looked at through the prism of the probability "p_{n,k}" to find exactly "k" real eigenvalues in the spectrum of an "n" by "n" real asymmetric Gaussian random…

We revisit the relative perturbation theory for invariant subspaces of positive definite matrix pairs. As a prototype model problem for our results we consider parameter dependent families of eigenvalue problems. We show that new estimates…

In the first part of this manuscript a relationship between the spectrum of self-adjoint operator matrices and the spectra of their diagonal entries is found. This leads to enclosures for spectral points and in particular, enclosures for…

The inverse eigenvalue problem of a graph studies the real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of the graph. The strong spectral property (SSP) is an important tool for this problem. This note…

In this note we consider $W$-shaped map $W_0=W_{s_1,s_2}$ with $\frac {1}{s_1}+\frac {1}{s_2}=1$ and show that eigenvalue 1 is not stable. We do this in a constructive way. For each perturbing map $W_a$ we show the existence of the "second"…

Identifying the collection of scalars that represent a non-negative matrix's eigenvalues is known as the non-negative inverse eigenvalue problem (NIEP). Conditions for the existence of a non-negative matrix with a certain spectrum are…

We present an alternative proof of the result by P. Gerard and S. Grellier, stating that given two real sequences $(\lambda_n)_{n=1}^\infty$, $(\mu_n)_{n=1}^\infty$ satisfying the intertwining relations \[ |\lambda_1| > |\mu_1| >…

Here, using two real non-zero parameters $\lambda$ and $\mu$, we construct Gaussian pseudo-orthogonal ensembles of a large number $N$ of $n \times n$ ($n$ even and large) real pseudo-symmetric matrices under the metric $\eta$ using $…

We study complex eigenvalues of large $N\times N$ symmetric random matrices of the form ${\cal H}=\hat{H}-i\hat{\Gamma}$, where both $\hat{H}$ and $\hat{\Gamma}$ are real symmetric, $\hat{H}$ is random Gaussian and $\hat{\Gamma}$ is such…

The eccentricity matrix of a simple connected graph is obtained from the distance matrix by only keeping the largest distances for each row and each column, whereas the remaining entries become zero. This matrix is also called the…

In this paper, we derive new relative perturbation bounds for eigenvectors and eigenvalues for regular quadratic eigenvalue problems of the form $\lambda^2 M x + \lambda C x + K x = 0$, where $M$ and $K$ are nonsingular Hermitian matrices…

We construct a family of involutions on the space $\mathfrak{gl}_n'(\mathbb C)$ of $n\times n$ matrices with real eigenvalues interpolating the complex conjugation and the transpose. We deduce from it a stratified homeomorphism between the…

In this paper we study $k$-equivariant wave maps from the hyperbolic plane into the $2$-sphere as well as the energy critical equivariant $SU(2)$ Yang-Mills problem on $4$-dimensional hyperbolic space. The latter problem bears many…

This work presents conjectures about eigenvalues of matrices associated with $k$-path graphs, the algebraic connectivity, defined as the second smallest eigenvalue of the Laplacian matrix, and the $\alpha$-index, as the largest eigenvalue…

We consider the family of $3 \times 3$ operator matrices ${\bf H}(K),$ $K \in {\Bbb T}^3:=(-\pi; \pi]^3$ associated with the lattice systems describing two identical bosons and one particle, another nature in interactions, without…

Let $q=p^f$ be a prime power, $H \leq \mathrm{GL}_d(q)$ a subgroup containing a genuine Singer cycle $s$ of order $q^d-1$, and $W$ an $\mathbb{F}_q H$-module whose scalar extension restricts to an untwisted polynomial tensor representation…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

The Wigner-von Neumann method, which was previously used for perturbing continuous Schr\"{o}dinger operators, is here applied to their discrete counterparts. In particular, we consider perturbations of arbitrary $T$-periodic Jacobi…