On the distance from a matrix to nilpotents
Michiya Mori

TL;DR
This paper establishes a lower bound on the distance from a complex matrix to nilpotent matrices under certain conditions, confirming conjectures by MacDonald and Herrero.
Contribution
It proves a new lower bound for the distance to nilpotents for matrices with specific projections, verifying two longstanding conjectures.
Findings
Lower bound of 0.5*sec(pi/(n+2)) for the distance to nilpotents
Verification of MacDonald's 1995 conjecture in special cases
Confirmation of a related conjecture in Herrero's book
Abstract
We prove that the distance from an complex matrix to the set of nilpotents is at least if there is a nonzero projection such that and . In the particular case where equals , this verifies a conjecture by G.W. MacDonald in 1995. We also confirm a related conjecture in D.A. Herrero's book.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Matrix Theory and Algorithms · Advanced Topics in Algebra
