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

离散Laplace算子特征值的交错不等式

Interlacing inequalities for eigenvalues of discrete Laplace operators

Danijela Horak, Jürgen Jost

摘要:

术语交织是指在由特定操作相关的对象上定义的两个算子的特征值序列之间的系统不等式。特别是,知识的频谱之一的对象,然后意味着本征值界的另一个。因此,本文中,我们发展了拓扑论证,以便导出这样的分析不等式。本文系统地研究了具有任意权值的加权单纯复形的谱交错问题。这使我们能够控制谱效应的操作,如删除一个子复形,折叠和收缩的单纯形,覆盖和单纯形映射,绝对和相对拉普拉斯。事实证明,许多著名的结果从图论成为特殊情况下,我们的一般结果,从而承认改进和推广。特别是,我们得到了一些有效的特征值界。

英文摘要:

The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies eigenvalue bounds for the other one. In this paper, we therefore develop topological arguments in order to de- rive such analytical inequalities. We investigate, in a general and systematic manner, interlacing of spectra for weighted simplicial complexes with arbi- trary weights. This enables us to control the spectral effects of operations like deletion of a subcomplex, collapsing and contraction of a simplex, cover- ings and simplicial maps, for absolute and relative Laplacians. It turns out that many well-known results from graph theory become special cases of our general results and consequently admit improvements and generalizations. In particular, we derive a number of effective eigenvalue bounds.

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

↑