An abstract version of the concentration compactness principle
By Ian Schindler, Kyril Tintarev. 2001
76 citations recorded by the source corpus.
Subfields: Applied Mathematics, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/2f46cf40a19f31ea0b4e5f1a5a23aac67ad7f7af
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Applied Mathematics
- Xiaoyi Zhang
- Shuanglin Shao
- Terence Tao
- Monica Visan
- B. Dodson
- A. Tertikas
- Kyril Tintarev
- Aynur Bulut
In Computational Theory and Mathematics
- Shuanglin Shao
- Monica Visan
- Xiaoyi Zhang
- A. Tertikas
- Terence Tao
- Kyril Tintarev
- Sanghyuk Lee
- Jonathan Bennett
Citations in the corpus
- On existence of minimizers for the Hardy–Sobolev–Maz’ya inequality (2005, methodology): “Instead, following the method of [17], it uses Lemma 5.”
- Minimal-mass blowup solutions of the mass-critical NLS (2006, methodology): “In other words, G is a group of dislocations in the sense of [29], and is thus a suitable group for constructing a concentration-compactness theory.”
- The linear profile decomposition for the Airy equation and the existence of maximizers for the Airy Strichartz inequality (2008, background): “Another important ingredient of the arguments is the idea of the concentration-compactness principle which aims to compensate for the defect of compactness of the Strichartz inequality, and was exploited in [Bahouri and Gérard 1999; Merle and Vega 1998; Carles and Keraani 2007; Bégout and Vargas 200”