arXiv · 1203.6557
Levinson's theorem for graphs II
Abstract
We prove Levinson's theorem for scattering on an (m+n)-vertex graph with n semi-infinite paths each attached to a different vertex, generalizing a previous result for the case n=1. This theorem counts the number of bound states in terms of the winding of the determinant of the S-matrix. We also provide a proof that the bound states and incoming scattering states of the Hamiltonian together form a complete basis for the Hilbert space, generalizing another result for the case n=1.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Andrew M. Childs, David Gosset. 2012-11-21. Levinson's theorem for graphs II. https://doi.org/10.1063/1.4757665
Cite the original work for its findings. Save a collection to share your selection of sources.