Proof of a conjecture on numerical ranges of weighted cyclic matrices

Research output: Contribution to journalArticlepeer-review

Abstract

Recall that the n-by-n weighted cyclic matrix with weights a1,…,an(∈C) is the matrix C(a1,…,an)=[0a10⋱⋱an−1an0], and W(C(a1,…,an)) is the numerical range of C(a1,…,an). Let Sn be the symmetric group on {1,…,n}. In [2], Chien et al. conjecture that if |a1|≥|a2|≥…≥|an| then W(C(aη(1),…,aη(n)))⊆W(C(aσn(1),…,aσn(n))) for any permutation η∈Sn, where σn∈Sn is defined by (σn(1),…,σn(n))={(n−1,…,4,2,1,3,5,…,n−2,n)if n is odd,(n−2,…,4,2,1,3,5,…,n−1,n)if n is even. In this note, we settle the conjecture in the affirmative.

Original languageEnglish
Pages (from-to)295-308
Number of pages14
JournalLinear Algebra and Its Applications
Volume682
DOIs
StatePublished - 1 Feb 2024

Keywords

  • Numerical radius
  • Numerical range
  • Weighted cyclic matrix

Fingerprint

Dive into the research topics of 'Proof of a conjecture on numerical ranges of weighted cyclic matrices'. Together they form a unique fingerprint.

Cite this