arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2507.09511math.COmath.DGmath.SP
收藏

通过结点域研究等角线

Equiangular lines via nodal domains

Chuanyuan Ge, Shiping Liu

AI总结:

本文通过特征函数的结点域概念,证明了第二大特征值的最大重数界,回答了Jiang等人的问题并改进了等角线相关结果。

摘要:

对于给定的 $Δ>0$ 和 $0<λ<3/\sqrt{2}$,我们证明了 $λ$ 作为最大度至多为 $Δ$ 的连通图的第二大特征值出现的最大重数为 $O_{Δ,λ}(1)$。该结果回答了 Jiang, Tidor, Yao, Zhang 和 Zhao [Question 6.4, Ann. of Math. (2) 194 (2021), no. 3, 729-743] 在 $0<λ<3/\sqrt{2}$ 情形下的问题,并进而改进了他们关于等角线的结果。我们的证明基于特征函数的结点域概念。具体而言,我们通过构造具有大量结点域的特征函数,建立了一个关于图的最大度和圈秩数的重数估计。

英文摘要:

For given $Δ>0$ and $0<λ<3/\sqrt{2}$, we show that the maximum multiplicity that $λ$ can appear as the second largest eigenvalue of a connected graph with maximum degree at most $Δ$ is $O_{Δ,λ}(1)$. This result answers a question due to Jiang, Tidor, Yao, Zhang and Zhao [Question 6.4, Ann. of Math. (2) 194 (2021), no. 3, 729-743] in the case of $0<λ<3/\sqrt{2}$, and consequently leads to improvements in their results on equiangular lines. Our proof is based on the concept of nodal domains of eigenfunctions. Indeed, we establish a multiplicity estimate in terms of maximum degree and cyclomatic number of the graph, via a novel construction of eigenfunctions with large number of nodal domains.

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

↑