Spectral minimal partitions of unbounded metric graphs
Laplacianlocally finite graphmetric graphquantum graphSchrödinger operatorspectral geometryspectral minimal partition
Distance in graphs (05C12) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Semilinear elliptic equations with Laplacian, bi-Laplacian or poly-Laplacian (35J91) Estimates of eigenvalues in context of PDEs (35P15) PDEs on graphs and networks (ramified or polygonal spaces) (35R02) Optimization of shapes other than minimal surfaces (49Q10) Spectral problems; spectral geometry; scattering theory on manifolds (58J50) Electro- and magnetostatics (78A30) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Summary: We investigate the existence or non-existence of spectral minimal partitions of unbounded metric graphs, where the operator applied to each of the partition elements is a Schrödinger operator of the form \(-\Delta +V\) with suitable (electric) potential \(V\), which is taken as a fixed, underlying function on the whole graph. We show that there is a strong link between spectral minimal partitions and infimal partition energies on the one hand, and the infimum \(\Sigma\) of the essential spectrum of the corresponding Schrödinger operator on the whole graph on the other. Namely, we show that for any \(k\in\mathbb{N}\), the infimal energy among all admissible \(k\)-partitions is bounded from above by \(\Sigma\), and if it is strictly below \(\Sigma\), then a spectral minimal \(k\)-partition exists. We illustrate our results with several examples of existence and non-existence of minimal partitions of unbounded and infinite graphs, with and without potentials. The nature of the proofs, a key ingredient of which is a version of the characterization of the infimum of the essential spectrum known as Persson's theorem for quantum graphs, strongly suggests that corresponding results should hold for Schrödinger operator-based partitions of unbounded domains in Euclidean space.
- A lower bound for nodal count on discrete and metric graphs
- A theory of spectral partitions of metric graphs
- Asymptotics and estimates for spectral minimal partitions of metric graphs
- Bounds for the Discrete Part of the Spectrum of a Semi-Bounded Schrödinger Operator.
- Computing nodal deficiency with a refined Dirichlet-to-Neumann map
- Ground state and orbital stability for the NLS equation on a general starlike graph with potentials
- scientific article; zbMATH DE number 3937637 (Why is no real title available?)
- Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs
- Introduction to quantum graphs
- Introduction to spectral theory. With applications to Schrödinger operators
- NLS ground states on metric trees: existence results and open questions
- Nodal and spectral minimal partitions -- The state of the art in 2016
- Nodal deficiency, spectral flow, and the Dirichlet-to-Neumann map
- Nodal statistics on quantum graphs
- On a class of optimal partition problems related to the Fučík spectrum and to the monotonicity formulae
- On Pleijel's nodal domain theorem for quantum graphs
- On the ground state for quantum graphs
- On the spectrum of the Laplacian on regular metric trees
- SCHRÖDINGER OPERATORS ON HOMOGENEOUS METRIC TREES: SPECTRUM IN GAPS
- Schrödinger operators with locally integrable potentials on infinite metric graphs
- Self‐adjoint and Markovian extensions of infinite quantum graphs
- Spectral estimates for infinite quantum graphs
- Spectral theory of infinite quantum graphs
- Stability of spectral partitions and the Dirichlet-to-Neumann map
- The number of nodal domains on quantum graphs as a stability index of graph partitions
This page was built for publication: Spectral minimal partitions of unbounded metric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062694)