Maximizing the Steklov eigenvalues on trees with a diameter constraint
Abstract
We study the first nonzero Steklov eigenvalue of the Dirichlet-to-Neumann operator on a finite tree with leaf boundary , under a constraint on the diameter . He and Hua [Calc. Var. PDE, 2022] showed that for any tree of diameter , with the even-diameter equality case fully characterized. For odd , the geometric picture underlying the sharp configurations has remained unclear beyond diameter three. We determine this picture completely for all odd diameters . The sharp value of is achieved on spider trees with nearly-equidistributed branch lengths, forming the family of \emph{generalized almost seesaw trees} , prescribed by the arithmetic of relative to . 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