Upper bounds for the Steklov eigenvalues on trees
Spectral Theory
2022-03-10 v5 Analysis of PDEs
Combinatorics
Abstract
In this paper, we study the upper bounds for discrete Steklov eigenvalues on trees via geometric quantities. For a finite tree, we prove sharp upper bounds for the first nonzero Steklov eigenvalue by the reciprocal of the size of the boundary and the diameter respectively. We also prove similar estimates for higher order Steklov eigenvalues.
Keywords
Cite
@article{arxiv.2011.11014,
title = {Upper bounds for the Steklov eigenvalues on trees},
author = {Zunwu He and Bobo Hua},
journal= {arXiv preprint arXiv:2011.11014},
year = {2022}
}
Comments
accepted by Calc. Var. Partial Differential Equations