Optimization of the lowest eigenvalue for leaky star graphs
Abstract
We consider the problem of geometric optimization for the lowest eigenvalue of the two-dimensional Schr\"odinger operator with an attractive δ-interaction of a fixed strength, the support of which is a star graph with finitely many edges of an equal length L ∈ (0,∞]. Under the constraint of fixed number of the edges and fixed length of them, we prove that the lowest eigenvalue is maximized by the fully symmetric star graph. The proof relies on the Birman-Schwinger principle, properties of the Macdonald function, and on a geometric inequality for polygons circumscribed into the unit circle.
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.