Publication

A logarithmic epiperimetric inequality for the obstacle problem

Maria Colombo
0
Article
Résumé

We study the regularity of the regular and of the singular set of the obstacle problem in any dimension. Our approach is related to the epiperimetric inequality of Weiss (Invent Math 138:23–50, Wei99a), which works at regular points and provides an alternative to the methods previously introduced by Caffarelli (Acta Math 139:155–184, Caf77). In his paper, Weiss uses a contradiction argument for the regular set and he asks the question if such epiperimetric inequality can be proved in a direct way (namely, exhibiting explicit competitors), which would have significant implications on the regularity of the free boundary in dimension d > 2. We answer positively the question of Weiss, proving at regular points the epiperimetric inequality in a direct way, and more significantly we introduce a new tool, which we call logarithmic epiperimetric inequality. It allows to study the regularity of the whole singular set and yields an explicit logarithmic modulus of continuity on the C1 regularity, thus improving previous results of Caffarelli and Monneau and providing a fully alternative method. It is the first instance in the literature (even in the context of minimal surfaces) of an epiperimetric inequality of logarithmic type and the first instance in which the epiperimetric inequality for singular points has a direct proof. Our logarithmic epiperimetric inequality at singular points has a quite general nature and will be applied to provide similar results in different contexts, for instance for the thin obstacle problem.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.