Upper bounds for Steklov eigenvalues of subgraphs of polynomial growth Cayley graphs
Léonard Tschanz
Abstract
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.
