Upper bounds for Steklov eigenvalues of subgraphs of polynomial growth Cayley graphs

Publication date 22 February 2022

Abstract: We study the Steklov problem on a subgraph with boundary

(O m e g a, B)

of a polynomial growth Cayley graph

G a m m a

. We prove that for each

k i n m a t h b b N

, the

k^{m b o x t h}

eigenvalue tends to

0

proportionally to

1 / | B |^{f r a c 1 d - 1}

, where

d

represents the growth rate of

G a m m a

. The method consists in associating a manifold

M

to

G a m m a

and a bounded domain

N s u b s e t M

to a subgraph

(O m e g a, B)

of

G a m m a

. We find upper bounds for the Steklov spectrum of

N

and transfer these bounds to

(O m e g a, B)

by discretizing

N

and using comparison Theorems.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Upper bounds for Steklov eigenvalues of subgraphs of polynomial growth Cayley graphs