2000
DOI: 10.1007/bf02392782
|View full text |Cite
|
Sign up to set email alerts
|

Sharp Lieb-Thirring inequalities in high dimensions

Abstract: 0. Introduction Let us consider a Schr5dinger operator in L2(Rd), -A+V, (0.1) where V is a real-valued function. Lieb and Thirring [231 proved that if'y>max(0, 1-ld), then there exist universal constants LT, d satisfying(1) tr (-A+V) ~ -<~ L%d [ V~_+d/2(x) dx. JR d (o.2) In the critical case d>~3 and "~=0, the bound (0.2) is known as the Cwikel LiebRozenblum (CLR) inequality, see [8], [20], [25] and also [7], [19]. For the remaining case d=l and .y=l, the estimate (0.2) has been verified in [27], see also [14]… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
210
0
2

Year Published

2000
2000
2008
2008

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 170 publications
(216 citation statements)
references
References 28 publications
4
210
0
2
Order By: Relevance
“…Lieb-Thirring inequalities for matrix-valued potentials for the value γ = 3/2 were obtained in [6] and also in [2]. Here we state a result corresponding to γ = 1.…”
Section: Introductionmentioning
confidence: 70%
See 1 more Smart Citation
“…Lieb-Thirring inequalities for matrix-valued potentials for the value γ = 3/2 were obtained in [6] and also in [2]. Here we state a result corresponding to γ = 1.…”
Section: Introductionmentioning
confidence: 70%
“…By using the Aizenman-Lieb argument [1], a "lifting" with respect to dimension [6], [5], and Theorem 1 we obtain the following result:…”
Section: Remarkmentioning
confidence: 95%
“…Here, as usual, the double braces denote the integer part. This lower limit has the merit of being rather neat, but it increases proportionally to g 2 (see (13)) rather than g 3 (see (16)), hence it cannot be expected to be cogent for strong potentials possessing many bound states.…”
Section: Limits On the Total Number Of Bound Statesmentioning
confidence: 99%
“…One can reduce a multidimensional problem to a one dimensional matrixvalued one using the main idea of Laptev and Weidl [18]. The result can be formulated as follows.…”
Section: The Laptev-weidl Methodsmentioning
confidence: 99%