Maximizing numerical radii of weighted shifts under weight permutations (Q442482): Difference between revisions
From MaRDI portal
Latest revision as of 13:03, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximizing numerical radii of weighted shifts under weight permutations |
scientific article |
Statements
Maximizing numerical radii of weighted shifts under weight permutations (English)
0 references
1 August 2012
0 references
Let \(S_n\) be the symmetric group of all permutations on \(\{1,2,\dots, n\}\) and \(w_1,\dots,w_n\in\mathbb{C}\). For \(l\in S_n\), let \(A_l\) be the weighted cyclic matrix with weights \((w_{l(i)})_{i=1}^n\). The main theorem of Section 2 states necessary and sufficient conditions for \(\xi\in S_n\) so that \(w_{\xi}=\sup_{l\in S_n}w(A_l)\), where \(w(A)\) stands for the numerical radius of \(A\). In Section 3, the authors consider this problem for infinite dimensional spaces and prove similar results for unilateral and bilateral weighted backward shifts.
0 references
numerical radius, weighted cyclic matrix
0 references
unilateral weighted shift
0 references
bilateral weighted shift
0 references