矩阵的无平方判别式与图的广义谱特征
Square-free Discriminants of Matrices and the Generalized Spectral Characterizations of Graphs
摘要:
令$S_n(\mathbb{Z})$和$O_n(\mathbb{Q})$分别表示整数环$\mathbb{Z}$上所有$n\times n$对称矩阵的集合和有理数域$\mathbb{Q}$上所有$n\times n$正交矩阵的集合。本文主要研究如下问题:给定一个矩阵$A\in {S_n(\mathbb{Z})}$。如何找到所有有理正交矩阵$Q\in{O_n(\mathbb{Q})}$,使得$Q^TAQ\in {S_n(\mathbb{Z})}$,并且具体地,当$Q^TAQ\in {S_n(\mathbb{Z})}$与$Q\in{O_n(\mathbb{Q})}$暗示$Q$是\emph{a signed permutation matrix}(即,通过将$P$中的每个1替换为1或$-1$而从置换矩阵$P$获得的矩阵)。对于$A$的特征多项式的判别式是否为奇且无平方的问题,给出了一个令人惊讶的简单答案,部分回答了上述问题。更精确地,令$Δ_A=\pm \res(ϕ,ϕ')$为\emph{the discriminant of matrix $A$},其中$\res(ϕ,ϕ')$为$A$及其导数$ϕ'$的特征多项式$ϕ$的\emph{the resultant}。我们证明了,如果$Δ_A$是奇数和无平方,那么$Q^TAQ\in {S_n(\mathbb{Z})}$与$Q\in{O_n(\mathbb{Q})}$意味着$Q$是一个有符号的置换矩阵。作为一个应用,我们提出了一个简单而有效的方法来测试一个图是否是由广义谱,这显着扩展了我们以前的工作。
英文摘要:
Let $S_n(\mathbb{Z})$ and $O_n(\mathbb{Q})$ denote the set of all $n\times n$ symmetric matrices over the ring of integers $\mathbb{Z}$ and the set of all $n\times n$ orthogonal matrices over the field of rational numbers $\mathbb{Q}$, respectively. The paper is mainly concerned with the following problem: Given a matrix $A\in {S_n(\mathbb{Z})}$. How can one find all rational orthogonal matrices $Q\in{O_n(\mathbb{Q})}$ such that $Q^TAQ\in {S_n(\mathbb{Z})}$, and in particular, when does $Q^TAQ\in {S_n(\mathbb{Z})}$ with $Q\in{O_n(\mathbb{Q})}$ imply that $Q$ is \emph{a signed permutation matrix} (i.e., the matrix obtained from a permutation matrix $P$ by replacing each 1 in $P$ with 1 or $-1$)? A surprisingly simple answer was given in terms of whether the discriminant of the characteristic polynomial of $A$ is odd and square-free, which partially answers the above questions. More precisely, let $Δ_A=\pm \res(ϕ,ϕ')$ be \emph{the discriminant of matrix $A$}, where $\res(ϕ,ϕ')$ is \emph{the resultant} of the characteristic polynomial $ϕ$ of $A$ and its derivative $ϕ'$. We show that if $Δ_A$ is odd and square-free, then $Q^TAQ\in {S_n(\mathbb{Z})}$ with $Q\in{O_n(\mathbb{Q})}$ implies that $Q$ 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。