arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.07032math.COcs.NAcs.SCmath.NAmath.NT
收藏

关于整数矩阵的特征值间隙

On Eigenvalue Gaps of Integer Matrices

Aaron Abrams, Zeph Landau, Jamie Pommersheim, Nikhil Srivastava

AI总结:

该研究构造了元素有界的整数矩阵,得到远小于此前结果的特征值最小间隙,其界与已知下界在指数常数因子内匹配,还证明了大量矩阵的间隙规模并构造了相应的0-1矩阵,为整数矩阵相关算法的最坏情况分析提供支撑。

摘要:

给定一个元素取值范围为[-h,h]的n×n整数矩阵,它的两个不同特征值之间的最小间距能有多小?此前已知的最优示例的最小间隙为h^{-O(n)}。本文给出了元素取值在[0,h]内的矩阵的显式构造,其两个特征值的间距至多为h^{-n²/16+o(n²)}。在指数的常数因子范围内,该结果与已知的Ω((2√n)^{-n²}h^{-n²})下界一致。最小间隙的界与整数矩阵对角化及标准形计算算法的最坏情况分析相关。除了显式构造,本文还证明存在大量矩阵的间隙略大,约为h^{-n²/32}。本文还构造了两个特征值间距至多为2^{-n²/64+o(n²)}的0-1矩阵。

英文摘要:

Given an $n\times n$ matrix with integer entries in the range $[-h,h]$, how close can two of its distinct eigenvalues be? The best previously known examples have a minimum gap of $h^{-O(n)}$. Here we give an explicit construction of matrices with entries in $[0,h]$ with two eigenvalues separated by at most $h^{-n^2/16+o(n^2)}$. Up to a constant in the exponent, this agrees with the known lower bound of $Ω((2\sqrt{n})^{-n^2}h^{-n^2})$ \cite{mahler1964inequality}. Bounds on the minimum gap are relevant to the worst case analysis of algorithms for diagonalization and computing canonical forms of integer matrices. In addition to our explicit construction, we show there are many matrices with a slightly larger gap of roughly $h^{-n^2/32}$. We also construct 0-1 matrices which have two eigenvalues separated by at most $2^{-n^2/64+o(n^2)}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑