Maximal order of growth for the resonance counting functions for generic potentials in even dimensions

Physics – Mathematical Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

33 pages and 1 figure

Scientific paper

We prove that the resonance counting functions for Schr\"odinger operators $H_V = - \Delta + V$ on $L^2 (\R^d)$, for $d \geq 2$ {\it even}, with generic, compactly-supported, real- or complex-valued potentials $V$, have the maximal order of growth $d$ on each sheet $\Lambda_m$, $m \in \Z \backslash \{0 \}$, of the logarithmic Riemann surface. We obtain this result by constructing, for each $m \in \Z \backslash \{0 \}$, a plurisubharmonic function from a scattering determinant whose zeros on the physical sheet $\Lambda_0$ determine the poles on $\Lambda_m$. We prove that the order of growth of the counting function is related to a suitable estimate on this function that we establish for generic potentials. We also show that for a potential that is the characteristic function of a ball, the resonance counting function is bounded below by $C_m r^d$ on each sheet $\Lambda_m$, $m \in \Z \backslash \{0\}$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Maximal order of growth for the resonance counting functions for generic potentials in even dimensions 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 Maximal order of growth for the resonance counting functions for generic potentials in even dimensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximal order of growth for the resonance counting functions for generic potentials in even dimensions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-710479

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.