Counting the Resonances in High and Even Dimensional Obstacle Scattering
Abstract
In this paper, we give a polynomial lower bound for the resonances of - perturbed by an obstacle in even-dimensional Euclidean spaces, n≥4. The proof is based on a Poisson Summation Formula which comes from the Hadamard factorization theorem in the open upper complex plane. We take advantage of the singularity of regularized wave trace to give the pole/resonance counting function over the principal branch of logarithmic plane a lower bound.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.