The Steklov problem on triangle-tiling graphs in the hyperbolic plane
Abstract
We introduce a graph which is roughly isometric to the hyperbolic plane and we study the Steklov eigenvalues of a subgraph with boundary of . For (l)l≥ 1 a sequence of subraphs of such that |l| ∞, we prove that for each k ∈ N, the kth eigenvalue tends to 0 proportionally to 1/|Bl|. The idea of the proof consists in finding a bounded domain N of the hyperbolic plane which is roughly isometric to , giving an upper bound for the Steklov eigenvalues of N and transferring this bound to via a process called discretization.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.