Asymptotic classification conjecture for positive singular solutions of poly-harmonic equations

About 4 years old · traced to

Let N=2mN=2m, let n⩾2mn\geqslant 2m, and let BR∗=BR∖0⊂RnB_R^*=B_R\setminus\\{0\\}\subset\mathbb{R}^n. Consider a positive singular solution u∈C2m(Rn∖0)u\in C^{2m}(\mathbb{R}^n\setminus\\{0\\}) of

(−Δ)mu=∣u∣p−1uin BR∗,(-\Delta)^m u=|u|^{p-1}u\quad\text{in }B_R^*,

where p∈[2m,∗,2m∗)p\in[2_{m,*},2_m^*), 2m,∗=nn−2m2_{m,*}=\frac{n}{n-2m}, and 2m∗=n+2mn−2m2_m^*=\frac{n+2m}{n-2m}. Write u‾\overline{u} for the radial asymptotic profile and let K0(n,p)K_0(n,p) and K^N,0(n)\widehat{K}_{N,0}(n) be the constants appearing in the asserted asymptotics. Assume that (−Δu)j⩾0(-\Delta u)^j\geqslant0 for every j=1,…,m−1j=1,\dots,m-1.

Asymptotic classification conjecture. If p∈(1,2m∗−1)p\in(1,2_m^*-1), then

u(x)=(1+O(∣x∣))u‾(x)as x→0.u(x)=(1+\mathcal{O}(|x|))\overline{u}(x)\quad\text{as }x\to0.

Moreover, (a) if p∈(1,2m∗)p\in(1,2_m^*), then u(x)≃∣x∣N−nu(x)\simeq |x|^{N-n} as x→0x\to0; (b) if p=2m,∗p=2_{m,*}, then

u(x)=(1+o(1))K^0(n)n−NN∣x∣N−n(ln⁡∣x∣)N−NNas x→0,u(x)=(1+\mathrm{o}(1))\widehat{K}_{0}(n)^{\frac{n-N}{N}}|x|^{N-n}(\ln|x|)^{\frac{N-N}{N}}\quad\text{as }x\to0,

where

K^N,0(n)=2m−2(m−1)!m∏j=0m−1(n−2j)(n−N)2;\widehat{K}_{N,0}(n)=\frac{2^{m-2}(m-1)!}{m}\prod_{j=0}^{m-1}(n-2j)(n-N)^2;

and (c) if p∈(2m,∗,2m∗−1)p\in(2_{m,*},2_m^*-1), then

u(x)=(1+o(1))K0(n,p)1p−1∣x∣−Np−1as x→0.u(x)=(1+\mathrm{o}(1))K_0(n,p)^{\frac{1}{p-1}}|x|^{-\frac{N}{p-1}}\quad\text{as }x\to0.

This conjecture seeks a complete local asymptotic classification near an isolated singularity for positive singular solutions of subcritical even-order poly-harmonic equations. The parser reports that the super poly-harmonic condition can be removed by an independent proof of X. Huang, Y. Li, and H. Yang, so the stated result is solved.

References

Primary source

João Henrique Andrade and Juncheng Wei, “Asymptotics for positive singular solutions to subcritical sixth order equations”, arXiv:2210.15102 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.