On Bounds for the Smallest and the Largest Eigenvalues of GCD and LCM Matrices
Ercan Alt{\i}n{\i}\c{s}{\i}k, \c{S}erife B\"uy\"ukk\"ose

TL;DR
This paper derives bounds for the smallest and largest eigenvalues of GCD and LCM matrices defined on the set {1, 2, ..., n}, using specific arithmetical functions.
Contribution
It provides new upper and lower bounds for eigenvalues of GCD and LCM matrices based on arithmetical functions, enhancing understanding of their spectral properties.
Findings
Established bounds for eigenvalues of GCD matrices
Established bounds for eigenvalues of LCM matrices
Bound expressions involve arithmetical functions
Abstract
In this paper, we study the eigenvalues of the GCD matrix and the LCM matrix defined on . We present upper and lower bounds for the smallest and the largest eigenvalues of and in terms of particular arithmetical functions.
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 · Advanced Mathematical Theories and Applications · Coding theory and cryptography
