pith. sign in

arxiv: 1701.06840 · v2 · pith:H65TQPOWnew · submitted 2017-01-24 · 🧮 math.SP · math-ph· math.MP· quant-ph

Optimization of the lowest eigenvalue for leaky star graphs

classification 🧮 math.SP math-phmath.MPquant-ph
keywords eigenvaluefixedloweststaredgesgeometricgraphlength
0
0 comments X
read the original abstract

We consider the problem of geometric optimization for the lowest eigenvalue of the two-dimensional Schr\"odinger operator with an attractive $\delta$-interaction of a fixed strength, the support of which is a star graph with finitely many edges of an equal length $L \in (0,\infty]$. 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.