Optimal regularity for the no-sign obstacle problem
John Andersson, Erik Lindgren, Henrik Shahgholian

TL;DR
This paper establishes the optimal $C^{1,1}$ regularity for a broad class of obstacle problems with minimal assumptions on the data, and proves the local smoothness of the free boundary under certain conditions.
Contribution
It proves the optimal regularity for obstacle problems with minimal assumptions and shows free boundary regularity under thickness and Dini conditions.
Findings
Proved $C^{1,1}$ regularity under the weakest possible assumptions.
Established local $C^1$-smoothness of the free boundary.
Solved a long-standing open problem in obstacle problem regularity.
Abstract
In this paper we prove the optimal -regularity for a general obstacle type problem under the assumption that is , where is the Newtonian potential. This is the weakest assumption for which one can hope to get -regularity. As a by-product of the -regularity we are able to prove that, under a standard thickness assumption on the zero set close to a free boundary point , the free boundary is locally a -graph close to , provided 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
