Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimal regularity for the no-sign obstacle problem

Published 4 May 2011 in math.AP | (1105.0717v1)

Abstract: In this paper we prove the optimal $C{1,1}(B_\frac12)$-regularity for a general obstacle type problem $$ \lap u = f\chi_{{u\neq 0}}\textup{in $B_1$}, $$ under the assumption that $f*N$ is $C{1,1}(B_1)$, where $N$ is the Newtonian potential. This is the weakest assumption for which one can hope to get $C{1,1}$-regularity. As a by-product of the $C{1,1}$-regularity we are able to prove that, under a standard thickness assumption on the zero set close to a free boundary point $x0$, the free boundary is locally a $C1$-graph close to $x0$, provided $f$ is Dini. This completely settles the question of the optimal regularity of this problem, that has been under much attention during the last two decades.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.