Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
GPT-4o
Gemini 2.5 Pro Pro
o3 Pro
GPT-4.1 Pro
DeepSeek R1 via Azure Pro
2000 character limit reached

New upper and lower bounds on the smallest singular values of nonsingular lower triangular $(0,1)$-matrices (2503.14180v1)

Published 18 Mar 2025 in math.CO

Abstract: Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min{\lambda\mid\lambda~\text{is an eigenvalue of}~XX{\rm T},~X\in K_n},\quad n\in\mathbb Z_+. $$ There have been a number of attempts in the literature to obtain bounds on the numbers $c_n$ by Mattila (2015), Altinisik et al. (2016), Kaarnioja (2021), Loewy (2021), and Altinisik (2021). In this paper, improved upper and lower bounds are derived on the numbers $c_n$. By considering the characteristic polynomial corresponding to the matrix $Z_n$ satisfying $c_n=|Z_n|_2{-1}$, it is shown that the second largest eigenvalue of $Z_n$ is bounded from above by $\frac45$ leading to an improved upper bound on $c_n$. Meanwhile, Samuelson's inequality applied to the roots of the characteristic polynomial of $Z_n$ yields an improved lower bound. Numerical experiments demonstrate the sharpness of the new bounds.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com