Levinson's theorem for graphs II

Details Levinson's theorem for graphs II Levinson's theorem for graphs II

2012-03-29

arxiv.org/abs/1203.6557v1

Physics

Mathematical Physics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Levinson's theorem for graphs II does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Levinson's theorem for graphs II, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Levinson's theorem for graphs II will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57922