Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Morse index and sign changing bubble towers for Lane-Emden problems (1406.3970v1)

Published 16 Jun 2014 in math.AP

Abstract: We consider the semilinear Lane-Emden problem \begin{equation}\label{problemAbstract}\left{ \begin{array}{lr} -\Delta u= |u|{p-1}u\qquad \mbox{ in }\Omega\ u=0\qquad\qquad\qquad\mbox{ on }\partial \Omega \end{array} \right.\tag{$\mathcal E_p$} \end{equation} where $p>1$ and $\Omega$ is a smooth bounded symmetric domain of $\mathbb R2$. We show that for families $(u_p)$ of sign-changing symmetric solutions of \eqref{problemAbstract} an upper bound on their Morse index implies concentration of the positive and negative part, $u_p\pm$, at the same point, as $p\to+\infty$. Then an asymptotic analysis of $u_p+$ and $u_p-$ shows that the asymptotic profile of $(u_p)$, as $p\to+\infty$, is that of a tower of two different bubbles.

Summary

We haven't generated a summary for this paper yet.