Related papers: A note on a conjecture concerning rank one perturb…

The classical Aronszajn-Donoghue theorem states that for a rank one perturbation of a self-adjoint operator (by a cyclic vector) the singular parts of the spectral measures of the original and perturbed operators are mutually singular. As…

We solve the problem of characterizing the Kronecker structure of a matrix pencil obtained by a rank-one perturbation of another matrix pencil. The results hold over arbitrary fields.

Let $K$ be a field and let $V$ be a vector space of dimension $n$ over $K$. Let $M$ be a subspace of bilinear forms defined on $V\times V$. Let $r$ be the number of different non-zero ranks that occur among the elements of $M$. Our aim is…

Wang and Zhao (Adv. Appl. Math. 173 (2026) 102994) generalized the classic Johnson-Newman theorem on simultaneous similarity of symmetric matrices from a single rank-one perturbation to multiple rank-one perturbations. However, their result…

We prove that for two-component maps in dimension two, rank-one convexity is equivalent to quasiconvexity. The essential tool for the proof is a fixed-point argument for a suitable set-valued map going from one component to the other that…

We prove several results about zeros of paraorthogonal polynomials using the theory of rank one perturbations of unitary operators. In particular, we obtain new details on the interlacing of zeros for successive POPUC.

This note investigates two long-standing conjectures on the Krull dimension of integer-valued polynomial rings and of polynomial rings, respectively, in the context of (locally) essential domains.

For a given self-adjoint operator $A$ with discrete spectrum, we completely characterize possible eigenvalues of its rank-one perturbations~$B$ and discuss the inverse problem of reconstructing $B$ from its spectrum.

This paper is concerned with the interplay between statistical asymmetry and spectral methods. Suppose we are interested in estimating a rank-1 and symmetric matrix $\mathbf{M}^{\star}\in \mathbb{R}^{n\times n}$, yet only a randomly…

Pseudospectra and structured pseudospectra are important tools for the analysis of matrices. Their computation, however, can be very demanding for all but small matrices. A new approach to compute approximations of pseudospectra and…

From a theory developed by C. Mehl, et al., a theory of the rank one perturbation of Hamiltonian systems with periodic coefficients is proposed. It is showed that the rank one perturbation of the fundamental solution of Hamiltonian system…

A family of Friedrichs models under rank one perturbations $h_{\mu}(p),$ $p \in (-\pi,\pi]^3$, $\mu>0,$ associated to a system of two particles on the three dimensional lattice $\Z^3$ is considered. We prove the existence of a unique…

Computing the first few singular vectors of a large matrix is a problem that frequently comes up in statistics and numerical analysis. Given the presence of noise, exact calculation is hard to achieve, and the following problem is of…

Recently, S. Grivaux showed that there exists a rank one perturbation of a unitary operator in a Hilbert space which is hypercyclic. Another construction was suggested later by the first and the third authors. Here, using a functional model…

A linear mapping upon real n-dimensional space, where the dimension n is odd, has a real eigenvalue-eigenvector pair. The corresponding statement for complex vector spaces holds true for any dimension n, but should be easy to demonstrate…

We present first-order perturbation analysis of a simple eigenvalue and the corresponding right and left eigenvectors of a general square matrix, not assumed to be Hermitian or normal. The eigenvalue result is well known to a broad…

Let $k$ be an algebraically closed field and $A$ the polynomial algebra in $r$ variables with coefficients in $k$. In case the characteristic of $k$ is $2$, Carlsson conjectured that for any $DG$-$A$-module $M$ of dimension $N$ as a free…

This book is about solving matrix nearness problems that are related to eigenvalues or singular values or pseudospectra. These problems arise in great diversity in various fields, be they related to dynamics, as in questions of robust…

In many applications it is important to understand the sensitivity of eigenvalues of a matrix polynomial to perturbations of the polynomial. The sensitivity commonly is described by condition numbers or pseudospectra. However, the…

We prove a new theorem relating the number of distinct eigenvalues of a matrix after perturbation to the prior number of distinct eigenvalues, the rank of the update, and the degree of nondiagonalizability of the matrix. In particular, a…