On sets in Rd with DC distance function

Abstract

We study closed sets F ⊂ Rd whose distance function dF:= dist\,(·,F) is DC (i.e., is the difference of two convex functions on Rd). Our main result asserts that if F ⊂ R2 is a graph of a DC function g: R R, then F has the above property. If d>1, the same holds if g: Rd-1 R is semiconcave, however the case of a general DC function g remains open.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…