多项式增长Cayley图子图的Steklov特征值上界
Upper bounds for Steklov eigenvalues of subgraphs of polynomial growth Cayley graphs
AI总结:
研究多项式增长Cayley图带边界子图的Steklov问题,通过关联流形并利用离散化与比较定理,证明了第k个特征值趋于0的比例上界。
摘要:
我们研究多项式增长Cayley图$Γ$的带边界子图$(Ω,B)$上的Steklov问题。我们证明对于每个$k \in \mathbb{N}$,第$k$个特征值趋于$0$的比例为$1/|B|^{\frac{1}{d-1}}$,其中$d$表示$Γ$的增长率。该方法包括将流形$M$关联到$Γ$,并将有界域$N \subset M$关联到$Γ$的子图$(Ω, B)$。我们找到$N$的Steklov谱的上界,并通过离散化$N$和使用比较定理将这些界限转移到$(Ω, B)$。
英文摘要:
We study the Steklov problem on a subgraph with boundary $(Ω,B)$ of a polynomial growth Cayley graph $Γ$. We prove that for each $k \in \mathbb{N}$, the $k^{\mbox{th}}$ eigenvalue tends to $0$ proportionally to $1/|B|^{\frac{1}{d-1}}$, where $d$ represents the growth rate of $Γ$. The method consists in associating a manifold $M$ to $Γ$ and a bounded domain $N \subset M$ to a subgraph $(Ω, B)$ of $Γ$. We find upper bounds for the Steklov spectrum of $N$ and transfer these bounds to $(Ω, B)$ by discretizing $N$ and using comparison Theorems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。