Abstract
Let and denote the set of all symmetric matrices over the ring of integers and the set of all orthogonal matrices over the field of rational numbers , respectively. The paper is mainly concerned with the following problem: Given a matrix . How can one find all rational orthogonal matrices such that , and in particular, when does with imply that is \emph{a signed permutation matrix} (i.e., the matrix obtained from a permutation matrix by replacing each 1 in with 1 or )? A surprisingly simple answer was given in terms of whether the discriminant of the characteristic polynomial of is odd and square-free, which partially answers the above questions. More precisely, let $Δ_A=\pm \res(ϕ,ϕ')$ be \emph{the discriminant of matrix }, where $\res(ϕ,ϕ')$ is \emph{the resultant} of the characteristic polynomial of and its derivative . We show that if is odd and square-free, then with implies that 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.