arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2202.06576math.DGmath.CO
收藏

组合图的最小Steklov特征值

Minimal Steklov eigenvalues on combinatorial graphs

Chengjie Yu, Yingtao Yu

摘要:

本文通过将Friedman的Laplacian特征函数节点域理论[Duke Math.J.69(1993),no.3,487- 525]推广到Steklov特征函数,研究了组合图上Steklov特征值的极值问题,并解决组合图上Steklov特征值的极值问题,该极值问题类似于Friedman [杜克数学杂志83(1996),第1期,第1- 18页。] Laplacian特征值更精确地说,我们主要证明了当$i\not|n$为$n$顶点的连通组合图上的$i^{\rm th}$ Steklov特征值的最小值本质上是由每条臂都是最小扫帚的星得到的,而当$i|n$为$i|n$顶点的连通组合图上的每齿都是最小扫帚的正则梳得到的.

英文摘要:

In this paper, we study extremal problems of Steklov eigenvalues on combinatorial graphs by extending Friedman's theory [Duke Math. J. 69 (1993), no. 3, 487--525] of nodal domains for Laplacian eigenfunctions to Steklov eigenfunctions, and solve an extremal problem for Steklov eigenvalues on combinatorial graphs that is an analogue of the extremal problem solved by Friedman [Duke Math. J. 83 (1996), no. 1, 1--18.] for Laplacian eigenvalues. More precisely, we mainly show that the minimum of the $i^{\rm th}$ Steklov eigenvalue on a connected combinatorial graph with $n$ vertices is essentially attained by a star with each arm a minimal broom when $i\not|n$, and attained by a regular comb with each tooth a minimal broom when $i|n$.

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

↑