paper

A new rearrangement inequality and its application for L^2-constraint minimizing problems

arXiv:1312.3575

Abstract

We study -constraint minimizing problems related to elliptic systems. We introduce a new rearrangement to show -precompactness of any minimizing sequences. Some strict inequality for the new rearrangement is obtained. It is a key to exclude the dichotomy of minimizing sequences.

Cited by in corpus (1)