A proof of the interlacing conjecture for the singular values of Sylvester-Kac matrices
Fuying Tang, Shuo Shi
Abstract
Boros and Rózsa (Linear Algebra Appl. 421 (2007) 407--416) reduced the singular value problem for the odd-order Sylvester--Kac matrix P∈R(2m+1)×(2m+1) to those for Q(m)∈R(m+1)× m and S(m)∈Rm×(m+1) via a permutation similarity transformation. They noted that (Q(m))TQ(m)-S(m)(S(m))T is positive definite, and also conjectured that σi(S(m))σi+1(Q(m)) for 1 i m-1 and m2. In this paper, we prove that these inequalities are strict and establish the strict interlacing relation equation* σ1(Q(m))>σ1(S(m))> ·s>σm(Q(m))> σm(S(m))>0 equation* for all m1. Here, σi(·) denotes the i-th largest singular value of a matrix.
Create a lesson
Related papers
Evolution algebras: a survey of results and a list of open problems
Ivan Kaygorodov, Cándido Mart\'ın González, Antonio Viruel
An infinite completely normal basis theorem
Patrik Lundström
Ideals in Enveloping Algebras of Loop Algebras
Alexey V. Petukhov, Susan J. Sierra
Automorphisms of Free Metabelian Lie Algebras, II
Ualbai Umirbaev
Star-Ordered Rotor Loops in Clifford Algebras
Nik Jenzer
Anti-successors and anti-replicators, Manin products and Koszul duality
Chengming Bai, Li Guo, Yunhe Sheng et al.