Upper bounds for the Steklov eigenvalues on trees
From MaRDI portal
Publication:2127338
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.
Upper bounds are given for discrete Steklov eigenvalues on trees via geometric quantities. For a finite tree, sharp upper bounds are obtained for the first nonzero Steklov eigenvalue by the reciprocal of the size of the boundary and the diameter respectively. Similar estimates are given for higher-order Steklov eigenvalues.
Recommendations
Cites work
- A Cheeger inequality for the Steklov spectrum
- A comparison theorem for the first non-zero Steklov eigenvalue
- A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity
- An isoperimetric inequality and the first Steklov eigenvalue
- An isoperimetric inequality for eigenvalues of the Stekloff problem
- Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
- First eigenvalue estimates of Dirichlet-to-Neumann operators on graphs
- Higher order Cheeger inequalities for Steklov eigenvalues
- scientific article; zbMATH DE number 3680356 (Why is no real title available?)
- scientific article; zbMATH DE number 3087123 (Why is no real title available?)
- scientific article; zbMATH DE number 3089408 (Why is no real title available?)
- Isoperimetric control of the Steklov spectrum
- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- Partial differential equations. II: Qualitative studies of linear equations
- Rigidity of a trace estimate for Steklov eigenvalues
- Some inequalities for Stekloff eigenvalues
- Spectral geometry of the Steklov problem (survey article)
- The first Steklov eigenvalue, conformal geometry, and minimal surfaces
- The geometry of the first non-zero Stekloff eigenvalue
- The Legacy of Vladimir Andreevich Steklov
- The Steklov spectrum and coarse discretizations of manifolds with boundary
- Upper bounds for Steklov eigenvalues on surfaces
Cited in
(13)- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- Isoperimetric upper bound for the first eigenvalue of discrete Steklov problems
- Upper bounds for Steklov eigenvalues of subgraphs of polynomial growth Cayley graphs
- Dirichlet-to-Neumann maps for differential forms on graphs and their eigenvalues
- Upper bounds on number of steals in rooted trees
- The Steklov problem on triangle-tiling graphs in the hyperbolic plane
- Some recent developments on the Steklov eigenvalue problem
- Monotonicity of Steklov eigenvalues on graphs and applications
- Upper bounds of Steklov eigenvalues on graphs
- Maximize the Steklov eigenvalue of trees
- Upper bounds for Steklov eigenvalues on surfaces
- Minimal Steklov eigenvalues on combinatorial graphs
- Sharp bounds and monotonicity results for Neumann eigenvalues on graphs
This page was built for publication: Upper bounds for the Steklov eigenvalues on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127338)