2019
DOI: 10.1002/mana.201700253
|View full text |Cite
|
Sign up to set email alerts
|

On the structure of WDC sets

Abstract: WDC sets in ℝ were recently defined as sublevel sets of DC functions (differences of convex functions) at weakly regular values. They form a natural and substantial generalization of sets with positive reach and still admit the definition of curvature measures. Using results on singularities of convex functions, we obtain regularity results on the boundaries of WDC sets. In particular, the boundary of a compact WDC set can be covered by finitely many DC surfaces. More generally, we prove that any compact WDC s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(18 citation statements)
references
References 24 publications
0
13
0
Order By: Relevance
“…However, using Proposition 4.2, we easily obtain: Proof. By our assumptions, f := dist (·, F ) is a DC function on R d and f (x) = 0 for every x ∈ C. So, by [12,Crollary 5.4] it is sufficient to prove that for each x ∈ C there exists y * ∈ ∂f (x) with |y * | > ε := 1/4, where ∂f (x) is the Clarke generalized gradient of f at x (see [3, p. 27]). To this end, suppose to the contrary that x ∈ C and ∂f (x) ⊂ B(0, 1/4).…”
Section: Other Resultsmentioning
confidence: 96%
See 2 more Smart Citations
“…However, using Proposition 4.2, we easily obtain: Proof. By our assumptions, f := dist (·, F ) is a DC function on R d and f (x) = 0 for every x ∈ C. So, by [12,Crollary 5.4] it is sufficient to prove that for each x ∈ C there exists y * ∈ ∂f (x) with |y * | > ε := 1/4, where ∂f (x) is the Clarke generalized gradient of f at x (see [3, p. 27]). To this end, suppose to the contrary that x ∈ C and ∂f (x) ⊂ B(0, 1/4).…”
Section: Other Resultsmentioning
confidence: 96%
“…Motivated by a natural question, for which non DC functions g (4.8) holds, we present the following result, whose proof is implicitly contained in the proof of [12,Proposition 6.6]; see Remark 4.4 below. Remark 4.4.…”
Section: Example 41 There Are Setsmentioning
confidence: 99%
See 1 more Smart Citation
“…Suppose that 𝑃 is a DC graph in ℝ 2 with 𝐾 = 𝑣 ⊥ . Then the following is true (see [14,Remark 7.1] for the proof, note that Lipschitzness of 𝑓 is not needed in the proof): for…”
Section: Lipschitz and DC Graphsmentioning
confidence: 99%
“…We will also use the following easy fact which we state without a proof. Let us recall some definitions and notation from [14,Definition 7.4]. If 𝑧 ∈ ℝ 2 and 𝑣 ∈ 𝕊 1 , we denote by 𝛾 𝑧,𝑣 the unique orientation-preserving isometry on ℝ 2 that maps 0 to 𝑧 and (1,0) to 𝑧 + 𝑣.…”
Section:  𝐖𝐃𝐂 Sets In Planementioning
confidence: 99%