A new rearrangement inequality and its application for L2-constraint minimizing problems
Abstract
We study L2-constraint minimizing problems related to elliptic systems. We introduce a new rearrangement to show H1-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.
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.