Abstract
We study a quantum Hamiltonian that is given by the (negative) Laplacian and an infinite chain of δ-like potentials with strength κ > 0 on the half line and which is equivalent to a one-parameter family of Laplacians on an infinite metric graph. This graph consists of an infinite chain of edges with the metric structure defined by assigning an interval In = [0, ln], , to each edge with length . We show that the one-parameter family of quantum graphs possesses a purely discrete and strictly positive spectrum for each κ > 0 and prove that the Dirichlet Laplacian is the limit of the one-parameter family in the strong resolvent sense. The spectrum of the resulting Dirichlet quantum graph is also purely discrete. The eigenvalues are given by λn = n2, , with multiplicities d(n), where d(n) denotes the divisor function. We can thus relate the spectral problem of this infinite quantum graph to Dirichlet's famous divisor problem and infer the non-standard Weyl asymptotics for the eigenvalue counting function. Based on an exact trace formula, the Voronoï summation formula, we derive explicit formulae for the trace of the wave group, the heat kernel, the resolvent and for various spectral zeta functions. These results enable us to establish a well-defined (renormalized) secular equation and a Selberg-like zeta function defined in terms of the classical periodic orbits of the graph for which we derive an exact functional equation and prove that the analogue of the Riemann hypothesis is true.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Physics A: Mathematical and Theoretical
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.