arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.08751math.SPmath.MG
收藏

第一类离散Steklov问题eigenvalue的等周上界

Isoperimetric upper bound for the first eigenvalue of discrete Steklov problems

Hélène Perrin

摘要:

研究了有限有界图上Steklov问题第一非零特征值的上界。对于一类多项式增长的Cayley图,给出了其第一个非零Steklov特征值的上界,它依赖于图的顶点数和边界数.作为推论,如果有边图也满足离散的等周不等式,我们证明了当图的顶点数趋于无穷大时,第一个非零Steklov特征值趋于零.这推广了Han和Hua最近的结果,他们在$\mathbb{Z}^n$的情况下得到了类似的结果。我们得到的结果使用度量性质的凯莱图与多项式增长的群体。

英文摘要:

We study upper bounds for the first non-zero eigenvalue of the Steklov problem defined on finite graphs with boundary. For finite graphs with boundary included in a Cayley graph associated to a group of polynomial growth, we give an upper bound for the first non-zero Steklov eigenvalue depending on the number of vertices of the graph and of its boundary. As a corollary, if the graph with boundary also satisfies a discrete isoperimetric inequality, we show that the first non-zero Steklov eigenvalue tends to zero as the number of vertices of the graph tends to infinity. This extends recent results of Han and Hua, who obtained a similar result in the case of $\mathbb{Z}^n$. We obtain the result using metric properties of Cayley graphs associated to groups of polynomial growth.

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

↑