Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The average distance problem with perimeter-to-area ratio penalization (2201.10100v1)

Published 25 Jan 2022 in math.AP

Abstract: In this paper we consider the functional \begin{equation*} E_{p,\la}(\Omega):=\int_\Omega \distp(x,\pd \Omega )\d x+\la \frac{\H1(\pd \Omega)}{\H2(\Omega)}. \end{equation*} Here $p\geq 1$, $\la>0$ are given parameters, the unknown $\Omega$ varies among compact, convex, Hausdorff two-dimensional sets of $\R2$, $\pd \Omega$ denotes the boundary of $\Omega$, and $\dist(x,\pd \Omega):=\inf_{y\in\pd \Omega}|x-y|$. The integral term $\int_\Omega \distp(x,\pd \Omega )\d x$ quantifies the "easiness" for points in $\Omega$ to reach the boundary, while $\frac{\H1(\pd \Omega)}{\H2(\Omega)}$ is the perimeter-to-area ratio. The main aim is to prove existence and $C{1,1}$-regularity of minimizers of $\E$.

Summary

We haven't generated a summary for this paper yet.