EUVIMEDEUVIMED entdecken
Crossref

The first Steklov eigenvalue of graphs of positive genus

Lixiang Chen, Yongtang Shi, Liwen Zhang

Bulletin of the London Mathematical Society · 2026-03 · 58 (3)

DOI: 10.1112/blms.70329 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bulletin of the London Mathematical Society, online erschienen am 06.03.2026. Verfasst von Lixiang Chen und 2 weiteren Autor:innen. Die Arbeit nennt 29 Literaturangaben. Gefördert von: China Postdoctoral Science Foundation, National Natural Science Foundation of China, Ministry of Education of the People's Republic of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let be a graph of genus with boundary . For , Lin and Zhao [J. Lond. Math. Soc. 112 (2025), Paper No. e70238] proved an upper bound for the first (non‐trivial) Steklov eigenvalue of , and they posed the problem of determining a corresponding bound for graphs of genus . In this paper, we prove an bound for a bounded‐degree graph of positive genus . Our result can be regarded as a discrete analogue of Kokarev's bound [Adv. Math. 258 (2014), 191–239], up to a constant factor.

Förderung

  • China Postdoctoral Science Foundation
  • National Natural Science Foundation of China
  • Ministry of Education of the People's Republic of China

Zitieren

APA

Chen, L., Shi, Y., & Zhang, L. (2026). The first Steklov eigenvalue of graphs of positive genus. Bulletin of the London Mathematical Society, 58(3). https://doi.org/10.1112/blms.70329

Vancouver

Chen L, Shi Y, Zhang L. The first Steklov eigenvalue of graphs of positive genus. Bulletin of the London Mathematical Society. 2026;58(3). doi:10.1112/blms.70329

BibTeX
@article{Chen2026,
  author = {Chen, Lixiang and Shi, Yongtang and Zhang, Liwen},
  title = {The first Steklov eigenvalue of graphs of positive genus},
  journal = {Bulletin of the London Mathematical Society},
  year = {2026},
  volume = {58},
  number = {3},
  doi = {10.1112/blms.70329}
}
Kostenlos starten →