Upper bounds for the Steklov eigenvalues on trees

From MaRDI portal
Publication:2127338

DOI10.1007/S00526-022-02207-6zbMATH Open1492.05090arXiv2011.11014OpenAlexW4226250542WikidataQ114017947 ScholiaQ114017947MaRDI QIDQ2127338FDOQ2127338


Authors: Zunwu He, Bobo Hua Edit this on Wikidata


Publication date: 20 April 2022

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

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.


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




Recommendations




Cites Work


Cited In (9)





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)