Square-free Discriminants of Matrices and the Generalized Spectral Characterizations of Graphs

preprint2016arXivOpen access

Abstract

Let Sn(Z)S_n(\mathbb{Z}) and On(Q)O_n(\mathbb{Q}) denote the set of all n×nn\times n symmetric matrices over the ring of integers Z\mathbb{Z} and the set of all n×nn\times n orthogonal matrices over the field of rational numbers Q\mathbb{Q}, respectively. The paper is mainly concerned with the following problem: Given a matrix A∈Sn(Z)A\in {S_n(\mathbb{Z})}. How can one find all rational orthogonal matrices Q∈On(Q)Q\in{O_n(\mathbb{Q})} such that QTAQ∈Sn(Z)Q^TAQ\in {S_n(\mathbb{Z})}, and in particular, when does QTAQ∈Sn(Z)Q^TAQ\in {S_n(\mathbb{Z})} with Q∈On(Q)Q\in{O_n(\mathbb{Q})} imply that QQ is \emph{a signed permutation matrix} (i.e., the matrix obtained from a permutation matrix PP by replacing each 1 in PP with 1 or −1-1)? A surprisingly simple answer was given in terms of whether the discriminant of the characteristic polynomial of AA is odd and square-free, which partially answers the above questions. More precisely, let $Δ_A=\pm \res(ϕ,ϕ')$ be \emph{the discriminant of matrix AA}, where $\res(ϕ,ϕ')$ is \emph{the resultant} of the characteristic polynomial ϕϕ of AA and its derivative ϕ′ϕ'. We show that if ΔAΔ_A is odd and square-free, then QTAQ∈Sn(Z)Q^TAQ\in {S_n(\mathbb{Z})} with Q∈On(Q)Q\in{O_n(\mathbb{Q})} implies that QQ is a signed permutation matrix. As an application, we present a simple and efficient method for testing whether a graph is determined by the generalized spectrum, which significantly extends our previous work.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.