Characterizing compact coincidence sets in the obstacle problem -- a short proof
Simon Eberle, Georg S. Weiss

TL;DR
This paper provides a concise proof that bounded coincidence sets with nonempty interior in the classical obstacle problem are ellipsoids, advancing understanding of the structure of solutions in higher dimensions.
Contribution
It offers a simplified, extendable proof of the characterization of bounded coincidence sets as ellipsoids in the obstacle problem.
Findings
Bounded coincidence sets with interior are ellipsoids.
The proof is concise and easily extendable.
Supports ongoing research on unbounded coincidence sets.
Abstract
Motivated by the almost completely open problem of characterizing unbounded coincidence sets of global solutions of the classical obstacle problem in higher dimensions, we give in this note a concise and easy-to-extend proof of the known fact that if the coincidence set of a global solution is bounded with nonempty interior then it is an ellipsoid.
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.
