On a generalization of the Johnson-Newman theorem to multiple rank-one perturbations
Combinatorics
2025-12-16 v1
Abstract
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 applies only to specific rank-one perturbations, and the given condition is quite involved as it relies on multivariate polynomials. We provide a simple proof of their result, leading to an improved version with a simplified condition that holds for arbitrary rank-one perturbations.
Keywords
Cite
@article{arxiv.2512.12599,
title = {On a generalization of the Johnson-Newman theorem to multiple rank-one perturbations},
author = {Wei Wang and Siqi Wu},
journal= {arXiv preprint arXiv:2512.12599},
year = {2025}
}
Comments
7 pages