2000 character limit reached
A logarithmic epiperimetric inequality for the obstacle problem (1708.02045v1)
Published 7 Aug 2017 in math.AP
Abstract: For the general obstacle problem, we prove by direct methods an epiperimetric inequality at regular and singular points, thus answering a question of Weiss (Invent. Math., 138 (1999), 23--50). In particular at singular points we introduce a new tool, which we call logarithmic epiperimetric inequality, which yields an explicit logarithmic modulus of continuity on the $C1$ regularity of the singular set, thus improving previous results of Caffarelli and Monneau.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.