Upper bounds for the Steklov eigenvalues on trees

DOI10.1007/S00526-022-02207-6MaRDI QIDQ2127338zbMATH OpenOpenAlexWikidataFDO

Authors Zunwu He, Bobo Hua

Publication date 20 April 2022

Published in Calculus of Variations and Partial Differential Equations (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2011.11014

zbMATH Keywords

treesSteklov problem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Variational inequalities (49J40) Variational methods for eigenvalues of operators (49R05) Eigenvalue problems for linear operators (47A75)

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.

Recommendations

• Lower bounds for the first eigenvalue of the Steklov problem on graphs
• Upper bounds for Steklov eigenvalues on surfaces
• Eigenvalue estimates for the Laplacian on a metric tree
• Isoperimetric upper bound for the first eigenvalue of discrete Steklov problems
• On the largest eigenvalues of trees

Cites work

• 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?)
• A Cheeger inequality for the Steklov spectrum
• A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity
• A comparison theorem for the first non-zero Steklov eigenvalue
• 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
• 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 Legacy of Vladimir Andreevich Steklov
• The Steklov spectrum and coarse discretizations of manifolds with boundary
• The first Steklov eigenvalue, conformal geometry, and minimal surfaces
• The geometry of the first non-zero Stekloff eigenvalue
• Upper bounds for Steklov eigenvalues on surfaces

Cited in

(9)

• Upper bounds on number of steals in rooted trees
• Lower bounds for the first eigenvalue of the Steklov problem on graphs
• Dirichlet-to-Neumann maps for differential forms on graphs and their eigenvalues
• Upper bounds for Steklov eigenvalues on surfaces
• Some recent developments on the Steklov eigenvalue problem
• Isoperimetric upper bound for the first eigenvalue of discrete Steklov problems
• Monotonicity of Steklov eigenvalues on graphs and applications
• Upper bounds for Steklov eigenvalues of subgraphs of polynomial growth Cayley graphs
• The Steklov problem on triangle-tiling graphs in the hyperbolic plane

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)