ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let the skew-symmetric matrix C(m)∈Rm×mC(m)\in\mathbb{R}^{m\times m} be defined by

C(m):=A(m)+ϵ(m+1)B(m),C(m):=A(m)+\epsilon(m+1)B(m),

where

A(m):=[01⋯1−1⋱⋱⋮vdots⋱⋱1−1⋯−10]∈Rm×m,A(m):=\begin{bmatrix}0&1&\cdots&1\\-1&\ddots&\ddots&\vdots\\vdots&\ddots&\ddots&1\\-1&\cdots&-1&0\end{bmatrix}\in\mathbb{R}^{m\times m},

and

B(m):=1[0 2 4 … 2(m−1)]−(1[0 2 4 … 2(m−1)])T∈Rm×m,B(m):=\mathbf{1}[0\ 2\ 4\ \ldots\ 2(m-1)]-\bigl(\mathbf{1}[0\ 2\ 4\ \ldots\ 2(m-1)]\bigr)^T\in\mathbb{R}^{m\times m},

with ϵ(m)=(m−1)−1(1−m−1/2)\epsilon(m)=(m-1)^{-1}(1-m^{-1/2}). The interlacing conjecture. For every m≥2m\geq 2, the matrices C(m)C(m) and C(m+1)C(m+1) satisfy

ωkm+1>ωkm>ωk+1m+1≥0,\omega_{k}^{m+1}>\omega_k^m>\omega_{k+1}^{m+1}\geq 0,

for k=1,…,⌊m/2⌋k=1,\ldots,\lfloor m/2\rfloor, where ±ωkmi\pm\omega_k^m i are the eigenvalues of C(m)C(m) and the ωkm\omega_k^m are sorted in non-decreasing order in kk for fixed mm. This property is used to establish admissible structures for target matrices in the constructive design of exploration sequences; the supplied text gives no resolution status beyond stating the property, so it is treated as open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.