Abstract:The inverse spectral problem for the Laplace operator on a finite metric graph is investigated. It is shown that this problem has a unique solution for graphs with rationally independent edges and without vertices having valence 2. To prove the result, a trace formula connecting the spectrum of the Laplace operator with the set of periodic orbits for the metric graph is established.
“…Actually, it was noted in [28] (see also [17,14]) that the multiplicity of λ = 0 as a root of (2.6) can be different from its multiplicity as an eigenvalue of the Laplace operator, but that for all positive eigenvalues the multiplicities coincide. To avoid this ambiguity we will omit the zero eigenvalues from the spectra that we consider; i.e.…”
Abstract. We investigate the equivalence between spectral characteristics of the Laplace operator on a metric graph and the associated unitary scattering operator. We prove that the statistics of level spacings and moments of observations in the eigenbases coincide in the limit that all bond lengths approach a positive constant value.
“…Actually, it was noted in [28] (see also [17,14]) that the multiplicity of λ = 0 as a root of (2.6) can be different from its multiplicity as an eigenvalue of the Laplace operator, but that for all positive eigenvalues the multiplicities coincide. To avoid this ambiguity we will omit the zero eigenvalues from the spectra that we consider; i.e.…”
Abstract. We investigate the equivalence between spectral characteristics of the Laplace operator on a metric graph and the associated unitary scattering operator. We prove that the statistics of level spacings and moments of observations in the eigenbases coincide in the limit that all bond lengths approach a positive constant value.
“…Topological characteristics of the graph may be reconstructed [19,20]. Assuming that the edge lengths are rationally independent one may even reconstruct the graph using the trace formula [15,18], but under the condition that the potential is zero. Explicit examples of isospectral graphs have been constructed [4,5,15].…”
Section: Spectral Estimates and Inverse Spectral Theorymentioning
Abstract. In this paper we study Schrödinger operators with absolutely integrable potentials on metric graphs. Uniform bounds-i.e. depending only on the graph and the potential-on the difference between the n th eigenvalues of the Laplace and Schrödinger operators are obtained. This in turn allows us to prove an extension of the classical Ambartsumian Theorem which was originally proven for Schrödinger operators with Neumann conditions on an interval. We also extend a previous result relating the spectrum of a Schrödinger operator to the Euler characteristic of the underlying metric graph.Mathematics Subject Classification. 34L15, 35R30, 81Q10.
“…All nonzero eigenvalues of L can be calculated using the vertex and edge scattering matrices [3,5,6,7,10]. The matrix S, and therefore the matrix S φ 1 ,φ 2 = DSD −1 , appearing in the vertex conditions is not only unitary, but also Hermitian.…”
Section: Getting Startedmentioning
confidence: 99%
“…If one of the fluxes is zero, then k = 0 is not a solution to the secular equation. It follows that the so-called algebraic multiplicity 1 m a (0) [10,6] of the zero eigenvalue is zero. Let us turn to calculation of the spectral multiplicity m s (0) -the number of linearly independent solutions to the equation Lψ = 0.…”
The magnetic Schrödinger operator was studied on a figure 8-shaped graph. It is shown that for specially chosen vertex conditions, the spectrum of the magnetic operator is independent of the flux through one of the loops, provided the flux through the other loop is zero. Topological reasons for this effect are explained.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.