On Circular Numerical Ranges of Companion Matrices with Repeated Eigenvalues

Abstract

We prove that if an n× n\ (n > 3) companion matrix A with the spectrum σ(A) = \ a \ has a circular numerical range, then A is the Jordan block. This problem can be described by examining zeros of the Laurent polynomial arising from geometric properties of the numerical range. The difficulty is that the relevant Laurent coefficients involve both the repeated eigenvalue a and the radius parameter λ, so direct coefficient comparison does not isolate a. We address this by decomposing the relevant matrix into a tridiagonal Toeplitz part plus a rank-two update and using Chebyshev polynomials of the second kind. This reduction yields an explicit Laurent-coefficient formula whose vanishing under the circularity condition gives a=0. Furthermore, we extend this result when the spectrum is σ(A) = \0, a\ with algebraic multiplicities n-m and m, respectively.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…