加载中…
Boros and Rózsa (Linear Algebra Appl. 421 (2007) 407–416) reduced the singular value problem for the odd-order Sylvester–Kac matrix to those for and via a permutation similarity transformation. They noted that is positive definite, and also conjectured that for and . In this paper, we prove that these inequalities are strict and establish the strict interlacing relation \begin{equation*} σ_1(Q^{(m)})>σ_1(S^{(m)})> \cdots>σ_m(Q^{(m)})> σ_m(S^{(m)})>0 \end{equation*} for all . Here, denotes the -th largest singular value of a matrix.

生成讲解博客的中文版本

生成AI智能校验的中文版本