On the Ilmonen-Haukkanen-Merikoski Conjecture
Ercan Alt{\i}n{\i}\c{s}{\i}k, Ali Keskin, Mehmet Y{\i}ld{\i}z and, Murat Demirb\"uken

TL;DR
This paper proves the Ilmonen-Haukkanen-Merikoski conjecture, which identifies the minimal eigenvalue among a specific set of lower triangular (0,1)-matrices with ones on the diagonal, using spectral radius inequalities.
Contribution
The paper provides a rigorous proof of the IHM conjecture, establishing the minimal eigenvalue explicitly for a class of structured matrices.
Findings
Confirmed the IHM conjecture for all n.
Identified the matrix achieving the minimal eigenvalue.
Used spectral radius inequalities in the proof.
Abstract
Let be the set of all lower triangular (0,1)-matrices with each diagonal element equal to , and let \begin{equation*} c_n = \min_{Z\in L_n} \left\lbrace \mu_n^{(1)}(Z):\mu_n^{(1)} (Z) \text{ is the smallest eigenvalue of } Z \right\rbrace . \end{equation*} The Ilmonen-Haukkanen-Merikoski conjecture (the IHM conjecture) states that is equal to the smallest eigenvalue of , where \begin{equation*} (Y_0)_{ij}=\left\lbrace \ \begin{array}{cl} 0 & \text{if } \ i<j, 1 & \text{if } \ i=j, \frac{1-(-1)^{i+j}}{2} & \text{if } \ i>j. \end{array} \right. \end{equation*} In this paper we present a proof of this conjecture. In our proof we use an inequality for spectral radii of nonnegative matrices.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Spectral Theory in Mathematical Physics · Graph theory and applications
