On the Crouzeix ratio for $N\times N$ matrices
Bartosz Malman, Javad Mashreghi, Ryan O'Loughlin, Thomas Ransford

TL;DR
This paper investigates the Crouzeix ratio for complex matrices, establishing an upper bound that depends only on the matrix size, advancing understanding of this ratio's behavior.
Contribution
It proves that the Crouzeix ratio is bounded above by a constant depending solely on the matrix size, improving previous universal bounds.
Findings
Crouzeix ratio is bounded by a size-dependent constant
The bound is strictly less than 1+√2 for all finite N
Continuity properties of the ratio map are analyzed
Abstract
The Crouzeix ratio of an complex matrix is the supremum of taken over all polynomials such that on the numerical range of . It is known that , and it is conjectured that . In this note, we show that , where is a constant depending only on and satisfying . The proof is based on a study of the continuity properties of the map .
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
TopicsMatrix Theory and Algorithms · Advanced Topics in Algebra · graph theory and CDMA systems
