Related papers: On a generalization of the Johnson-Newman theorem …

A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…

The symmetric rank-one update method is well-known in optimization for its applications in the quasi-Newton algorithm. In particular, Conn, Gould, and Toint proved in 1991 that the matrix sequence resulting from this method approximates the…

We prove the invariance of scalar Feynman graphs of any planar topology under the Yangian level-one momentum symmetry given certain constraints on the propagator powers. The proof relies on relating this symmetry to a planarized version of…

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

The article is devoted to different aspects of the question "What can be done with a matrix by low rank perturbation?" It is proved that one can change a geometrically simple spectrum drastically by a rank 1 permutation, but the situation…

A theory of rank $k\ge 2$ perturbation of symplectic matrices and Hamiltonian systems with periodic coefficients using a base of isotropic subspaces, is presented. After showing that the fundamental matrix ${\displaystyle…

We show that a normal matrix $A$ with coefficient in $\mathbb C[[X]]$, $X=(X_1, \ldots, X_n)$, can be diagonalized, provided the discriminant $\Delta_A $ of its characteristic polynomial is a monomial times a unit. The proof is an…

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…

We show that a perturbation of any fixed square matrix D by a random unitary matrix is well invertible with high probability. A similar result holds for perturbations by random orthogonal matrices; the only notable exception is when D is…

Rank-one update of the spectrum of a matrix is a fundamental problem in classical perturbation theory. In this paper, we consider its variant where only part of the spectrum is known. We address this variant using an efficient scheme for…

A generalization of Newton's identity on symmetric functions is given. Using the generalized Newton identity we give a unified method to show the existence of Hall-Littlewood, Jack and Macdonald polynomials. We also give a simple proof of…

We extend the result of Markus, Spielman, and Srivastava about the sum of rank-one symmetric random matrices to the case when the isotropy assumption on the random matrices is relaxed.

We show how the spectrum of a graph Laplacian changes with respect to a certain type of rank-one perturbation. We apply our finding to give new short proofs of the spectral version of Kirchhoff's Matrix Tree Theorem and known derivations…

Matrix-valued measures provide a natural language for the theory of finite rank perturbations. In this paper we use this language to prove some new perturbation theoretic results. Our main result is a generalization of the…

Let $A$ be an $n\times n$ random symmetric matrix with independent identically distributed subgaussian entries of unit variance. We prove the following large deviation inequality for the rank of $A$: for all $1\leq k\leq c\sqrt{n}$,…

A number of random matrix ensembles permitting exact determination of their eigenvalue and eigenvector statistics maintain this property under a rank $1$ perturbation. Considered in this review are the additive rank $1$ perturbation of the…

We consider the problem of estimating a rank-one nonsymmetric matrix under additive white Gaussian noise. The matrix to estimate can be written as the outer product of two vectors and we look at the special case in which both vectors are…

In this paper, we extend original Neural Collapse Phenomenon by proving Generalized Neural Collapse hypothesis. We obtain Grassmannian Frame structure from the optimization and generalization of classification. This structure maximally…

We present in this note a correction to Theorem 17 in our earlier paper "Global properties of eigenvalues of parametric rank one perturbations for structured and unstructured matrices" and sharpen the estimates for eigenvalues of parametric…

The randomised Horn problem, in both its additive and multiplicative version, has recently drawn increasing interest. Especially, closed analytical results have been found for the rank-1 perturbation of sums of Hermitian matrices and…