Mathematics > Spectral Theory
[Submitted on 23 Sep 2009]
Title:An Improvement to a Berezin-Li-Yau type inequality for the Klein-Gordon Operator
View PDFAbstract: In this article we improve a lower bound for $\sum_{j=1}^k\beta_j$ (a Berezin-Li-Yau type inequality) in [E. M. Harrell II and S. Yildirim Yolcu, Eigenvalue inequalities for Klein-Gordon Operators, J. Funct. Analysis, 256(12) (2009) 3977-3995]. Here $\beta_j$ denotes the $j$th eigenvalue of the Klein Gordon Hamiltonian $H_{0,\Omega}=|p|$ when restricted to a bounded set $\Omega\subset {\mathbb R}^n$. $H_{0,\Omega}$ can also be described as the generator of the Cauchy stochastic process with a killing condition on $\partial \Omega$. (cf. [R. Banuelos, T. Kulczycki, Eigenvalue gaps for the Cauchy process and a Poincare inequality, J. Funct. Anal. 211 (2) (2004) 355-423]; [R. Banuelos, T. Kulczycki, The Cauchy process and the Steklov problem, J. Funct. Anal. 234 (2006) 199-225].) To do this, we adapt the proof of Melas ([ A. D. Melas, A lower bound for sums of eigenvalues of the Laplacian, Proceedings of the American Mathematical Society, 131(2) (2002) 631-636]), who improved the estimate for the bound of $\sum_{j=1}^k\lambda_j$, where $\lambda_j$ denotes the $j$th eigenvalue of the Dirichlet Laplacian on a bounded domain in ${\mathbb R}^d$.
Submission history
From: Selma Yildirim Yolcu [view email][v1] Wed, 23 Sep 2009 06:37:04 UTC (6 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.