| Popis: |
Symmetrisable matrices are those that are a real diagonal change of basis away from being symmetric. Restricting to matrices that have integer entries (symmetrisable integer matrices — SIMs) we enter the worlds of combinatorics and number theory. It is known that quotients of equitable partitions of graphs provide examples of SIMs (with all entries nonnegative). We note a converse result, that every SIM comes from a quotient of an equitable partition of a signed graph (in the nonnegative case, a graph). There is a beautiful well-known combinatorial description of SIMs, which leads to a necessary combinatorial/number-theoretic property of their symmetrisations. We show that this property in fact classifies the matrices that are symmetrisations of SIMs. We then turn to the Schur-Siegel-Smyth trace problem for totally positive algebraic integers. The analogous problem for eigenvalues of positive definite integer symmetric matrices (ISMs) was recently solved. We extend this to SIMs, showing that if A is a connected positive definite n × n SIM, then tr ( A ) ≥ 2 n − 1 , and that if equality holds then A must in fact be symmetric. We explore the structure of minimal-trace examples, in both the symmetric and asymmetric cases. |
Full Text from ScienceDirect