Maximize the Steklov eigenvalue of trees
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912455190380544 |
|---|---|
| author | Lin, Huiqiu Zhao, Da |
| author_facet | Lin, Huiqiu Zhao, Da |
| contents | We study the maximal Steklov eigenvalues of trees with given number of boundary vertices and total number of vertices. Trees can be regarded as discrete analogue of Hadamard manifolds, namely simply-connected Riemannian manifolds of non-positive sectional curvature. Let $σ_{k,\text{max}}(b, n)$ be the maximal of $k$-th Steklov eigenvalue of trees with $b$ leaves as boundary and $n$ vertices. We determine that $$ σ_{2, \text{max}} (b, n) = \begin{cases}
\frac{2}{n-1}, & b=2, n\geq 3,
\frac{1}{r}, & b \geq 3, n = br + m, 3 - b \leq m \leq 1, r \in \mathbb{Z}_+,
\frac{1}{r+1-\frac{1}{b}}, & b \geq 3, n = br + 2, r \in \mathbb{Z}_+, \end{cases} $$ and we characterize the trees attaining this bound. For $k \geq 3$, we show that $σ_{k, \text{max}} (b, n) = 1$. We also give a lower bound on the maximal Steklov eigenvalues of trees with given diameter and total number of vertices. Our work can be regarded as a completion of the work by He--Hua [Upper bounds for the Steklov eigenvalues on trees, Calc. Var. Partial Differential Equations (2022)] and Yu--Yu [Monotonicity of Steklov eigenvalues on graphs and applications, Calc. Var. Partial Differential Equations (2024)]. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_12787 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Maximize the Steklov eigenvalue of trees Lin, Huiqiu Zhao, Da Combinatorics 05C05, 47A75, 49J40, 49R05 We study the maximal Steklov eigenvalues of trees with given number of boundary vertices and total number of vertices. Trees can be regarded as discrete analogue of Hadamard manifolds, namely simply-connected Riemannian manifolds of non-positive sectional curvature. Let $σ_{k,\text{max}}(b, n)$ be the maximal of $k$-th Steklov eigenvalue of trees with $b$ leaves as boundary and $n$ vertices. We determine that $$ σ_{2, \text{max}} (b, n) = \begin{cases} \frac{2}{n-1}, & b=2, n\geq 3, \frac{1}{r}, & b \geq 3, n = br + m, 3 - b \leq m \leq 1, r \in \mathbb{Z}_+, \frac{1}{r+1-\frac{1}{b}}, & b \geq 3, n = br + 2, r \in \mathbb{Z}_+, \end{cases} $$ and we characterize the trees attaining this bound. For $k \geq 3$, we show that $σ_{k, \text{max}} (b, n) = 1$. We also give a lower bound on the maximal Steklov eigenvalues of trees with given diameter and total number of vertices. Our work can be regarded as a completion of the work by He--Hua [Upper bounds for the Steklov eigenvalues on trees, Calc. Var. Partial Differential Equations (2022)] and Yu--Yu [Monotonicity of Steklov eigenvalues on graphs and applications, Calc. Var. Partial Differential Equations (2024)]. |
| title | Maximize the Steklov eigenvalue of trees |
| topic | Combinatorics 05C05, 47A75, 49J40, 49R05 |
| url | https://arxiv.org/abs/2412.12787 |