On sets in {mathbb R}^d with DC distance function
classification
🧮 math.CA
keywords
mathbbfunctiondistancesetssubsetaboveassertscase
read the original abstract
We study closed sets $F \subset {\mathbb R}^d$ whose distance function $d_F:= {\rm dist}\,(\cdot,F)$ is DC (i.e., is the difference of two convex functions on ${\mathbb R}^d$). Our main result asserts that if $F \subset {\mathbb R}^2$ is a graph of a DC function $g:{\mathbb R}\to {\mathbb R}$, then $F$ has the above property. If $d>1$, the same holds if $g:{\mathbb R}^{d-1}\to {\mathbb R}$ is semiconcave, however the case of a general DC function $g$ remains open.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.