a1b2c3d4e5f6g7h8!the c-pawn is offered

Queen’s Gambit

1. d4 d5   2. c4

Endgame
Papers

Research

1 papers
  • Effect of edge-stretching on Steklov eigenvalues and sharp Steklov eigenvalue bounds on leaf–boundary trees

    Jiangdong Ai, Yizhe Ji, Xiaopan Lian, Kun Yang

    Let T be a finite tree with leaf set as the boundary and let λ₂ be the first nontrivial Steklov eigenvalue. Motivated by neck-stretching on Riemannian manifolds, we study a discrete counterpart—edge-stretching—and prove that Steklov eigenvalues decrease monotonically under this operation. As a consequence, λ₂ ≤ D/ℓ, with equality if and only if T is a star, improving the constant in He–Hua’s bound to the optimal value 1. We also give a closed-form diagonalization on level-regular trees, an upper bound for higher eigenvalues, and numerical evidence for the Lin–Zhao extremal conjecture.

    2026·arXiv preprint·arXiv:2603.26251Graph TheorySteklovTreesmath.CO
    arXivPDF
Sherr1

Extremal graph theory & additive combinatorics.

© 2024–2026

In the sight of 0 readers.

About

  • About me
  • Notes
  • Course PDFs
  • CV

More

  • Timeline
  • Research
  • Diary
  • GitHub↗

Contact

  • Leave a message
  • Send email↗
  • Zhihu↗
RSS Feed·Sitemap
|··|

Search