Counting Spectral Radii of Matrices with Positive Entries
J. A. Dias da Silva, Pedro J. Freitas

TL;DR
This paper investigates the diversity of spectral radii of matrices with positive entries from a set A, establishing lower bounds on their number and relating it to sum-product phenomena in additive combinatorics.
Contribution
It introduces bounds on the number of distinct spectral radii of matrices with entries in A, connecting spectral properties to sum-product conjectures.
Findings
Lower bounds for spectral radii cardinality for matrices with entries in A.
For 2x2 matrices, spectral radii count exceeds max of sum and product set sizes.
Links spectral radius diversity to sum-product conjecture in additive combinatorics.
Abstract
The sum-product conjecture of Erd\H os and Szemer\'edi states that, given a finite set of positive numbers, one can find asymptotic lower bounds for of the order of for every . In this paper we consider the set of all spectral radii of matrices with entries in , and find lower bounds for the cardinality of this set. In the case , this cardinality is necessarily larger than .
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
TopicsGraph theory and applications · Matrix Theory and Algorithms · Limits and Structures in Graph Theory
