Publication

A logarithmic epiperimetric inequality for the obstacle problem

Publications associées (35)

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.

Connectez-vous pour utiliser Chat avec Graph Search

Stable cones in the thin one-phase problem

Xavier Fernandez-Real Girona

The aim of this work is to study homogeneous stable solutions to the thin (or fractional) one -phase free boundary problem. The problem of classifying stable (or minimal) homogeneous solutions in dimensions n >= 3 is completely open. In this context, axial ...

Johns Hopkins Univ Press2024

, ,

We present LISA, a proof system and proof assistant for constructing proofs in schematic first-order logic and axiomatic set theory. The logical kernel of the system is a proof checker for first-order logic with equality and schematic predicate and fun ...

2023

Graphical solutions to one-phase free boundary problems

Xavier Fernandez-Real Girona, Hui Yu

We study viscosity solutions to the classical one-phase problem and its thin counterpart. In low dimensions, we show that when the free boundary is the graph of a continuous function, the solution is the half-plane solution. This answers, in the salient di ...

Berlin2023

An unrefinement algorithm for planar THB-spline parameterizations

Annalisa Buffa

Unrefinement is a tool that allows to perform faster numerical simulations by controlling the level of precision in the specified area. We introduce an algorithm that creates a coarser geometry from an initial regular geometry, which is represented with re ...

ELSEVIER2022

We investigate the regularity of the free boundary for the Signorini problem in Rn+1. It is known that regular points are (n−1)-dimensional and C∞. However, even for C∞ obstacles φ, the set of non-regular (or degenerate) points could be very large—e.g. wit ...

2021

, ,

We provide a counterexample to the performance guarantee obtained in the paper "Il'ev, V., Linker, N., 2006. Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid", which was published in Volume 171 of the Eur ...

ELSEVIER2021

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

Gaspard Ohlmann

In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d = 0. Their values have already been computed by Kim and Stanton in 2015, h ...

ELECTRONIC JOURNAL OF COMBINATORICS2021

Being bounded by hydrological (inflow and barrier) boundaries, natural aquifers have regular/irregular shapes. Here, we consider aquifers bounded by segmental inflow (variable head) boundaries in which water is extracted/injected by a multi-well system. St ...

2020

Cost for a controlled linear KdV equation

Joachim Krieger, Shengquan Xiang

The controllability of the linearized KdV equation with right Neumann control is studied in the pioneering work of Rosier [25]. However, the proof is by contradiction arguments and the value of the observability constant remains unknown, though rich mathem ...

2019

, , ,

1,3,2-Diazaphospholenes (DAPs) are an emerging class of organic hydrides. In this work, we exploited them as efficient catalysts for very mild reductive Claisen rearrangements. The method is tolerant towards a wide variety of functional groups and operates ...

2019