2000 character limit reached
On fractional Hardy inequalities in convex sets (1802.02354v2)
Published 7 Feb 2018 in math.AP and math.FA
Abstract: We prove a Hardy inequality on convex sets, for fractional Sobolev-Slobodecki\u{\i} spaces of order $(s,p)$. The proof is based on the fact that in a convex set the distance from the boundary is a superharmonic function, in a suitable sense. The result holds for every $1<p<\infty$ and $0<s<1$, with a constant which is stable as $s$ goes to $1$.
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.