Upper bounds for the Steklov eigenvalues on trees (Q2127338)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7510381
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds for the Steklov eigenvalues on trees |
scientific article; zbMATH DE number 7510381 |
Statements
Upper bounds for the Steklov eigenvalues on trees (English)
0 references
20 April 2022
0 references
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.
0 references
Steklov problem
0 references
trees
0 references
0.8169063329696655
0 references
0.8098173141479492
0 references
0.7970613241195679
0 references
0.7953433990478516
0 references
0.7697466611862183
0 references
