English

Maximizing the Steklov eigenvalues on trees with a diameter constraint

Combinatorics 2026-04-15 v1

Abstract

We study the first nonzero Steklov eigenvalue λ2(T,δΩ)\lambda_2(T,\delta\Omega) of the Dirichlet-to-Neumann operator on a finite tree TT with leaf boundary δΩ\delta\Omega, under a constraint on the diameter DD. He and Hua [Calc. Var. PDE, 2022] showed that λ2(T)2/D\lambda_2(T) \leq 2/D for any tree of diameter DD, with the even-diameter equality case fully characterized. For odd DD, the geometric picture underlying the sharp configurations has remained unclear beyond diameter three. We determine this picture completely for all odd diameters D=2r+15D = 2r+1 \geq 5. The sharp value of λ2\lambda_2 is achieved on spider trees with nearly-equidistributed branch lengths, forming the family of \emph{generalized almost seesaw trees} AS(r,q+2,c,t)\mathrm{AS}(r,q+2,c,t), prescribed by the arithmetic of nn relative to r/2\lceil r/2 \rceil. Together with the results of He-Hua and Lin-Zhao [Bull. Lond. Math. Soc., 2025] for even diameters and diameter three, this completes the geometric classification for every diameter. The argument is based on a scalar root equation for one-center profiles, an inverse boundary quadratic form on boundary fluxes, and a reduction scheme from arbitrary trees to two-center profiles, and then to the one-center class. The inverse variational viewpoint may be regarded as a boundary analogue of the classical distance-matrix formalism for trees initiated by Graham and Lov\'asz [Adv. Math., 1978].

Keywords

Cite

@article{arxiv.2604.12404,
  title  = {Maximizing the Steklov eigenvalues on trees with a diameter constraint},
  author = {Jiangdong Ai and Huiqiu Lin and Yongtang Shi},
  journal= {arXiv preprint arXiv:2604.12404},
  year   = {2026}
}

Comments

22 pages, 1 figure

R2 v1 2026-07-01T12:08:12.524Z