由拉姆齐理论得到的矩阵的半正定性
Positive Semidefiniteness of Matrices arising from Ramsey Theory
摘要:
本文解决了Cooper-Fenner-Purewal的一个猜想:可用于限制小乘积Ramsey数的组合矩阵序列是半正定的.由于与拉姆齐理论的联系涉及求解与这些矩阵相关的二次整数规划,这意味着存在相对有效的算法来限制所述数字。证明是直接的,并产生重要的结构信息:我们列举的特征值和特征空间明确采用超几何身份。
英文摘要:
We resolve a conjecture of Cooper-Fenner-Purewal that a certain sequence of combinatorial matrices which can be used to bound small product-Ramsey numbers is positive semidefinite. Because the connection to Ramsey Theory involves solving quadratic integer programs associated to these matrices, this implies that there are relatively efficient algorithms for bounding said numbers. The proof is direct, and yields important structural information: we enumerate the eigenvalues and eigenspaces explicitly by employing hypergeometric identities.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。