Higher-rank Numerical Ranges and Kippenhahn Polynomials

preprint2012arXivOpen access

Abstract

We prove that two n-by-n matrices A and B have their rank-k numerical ranges Λk(A)Λ_k(A) and Λk(B)Λ_k(B) equal to each other for all k, 1≤k≤⌊n/2⌋+11\le k\le \lfloor n/2\rfloor+1, if and only if their Kippenhahn polynomials pA(x,y,z)≡det⁡(xReA+yImA+zIn)p_A(x,y,z)\equiv\det(x Re A+y Im A+zI_n) and pB(x,y,z)≡det⁡(xReB+yImB+zIn)p_B(x,y,z)\equiv\det(x Re B+y Im B+zI_n) coincide. The main tools for the proof are the Li-Sze characterization of higher-rank numerical ranges, Weyl's perturbation theorem for eigenvalues of Hermitian matrices and Bezout's theorem for the number of common zeros for two homogeneous polynomials.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.