Topological properties of closed weakly $m$-convex sets
Tetiana Osipchuk

TL;DR
This paper explores the topological and convexity properties of weakly m-convex sets in Euclidean space, establishing conditions for their connectedness and constructing examples for various dimensions and convexity levels.
Contribution
It provides new insights into the structure of weakly m-convex sets, including their connected components and nonconvexity points, extending the theory of convexity in higher dimensions.
Findings
Any closed, weakly (n-1)-convex set with non-empty nonconvexity points has at least three components.
The interior of a closed, weakly 1-convex set with finitely many components in the plane is weakly 1-convex.
Constructed examples of weakly m-convex domains and sets with non-empty nonconvexity points for all relevant dimensions.
Abstract
The present work considers the properties of generally convex sets in the -dimensional real Euclidean space , , known as weakly -convex, . An open set of is called weakly -convex if for any boundary point of the set there exists an -dimensional plane passing through this point and not intersecting the given set. A closed set of is called weakly -convex if it is approximated from the outside by a family of open weakly -convex sets. A point of the complement of a set of to the whole space is called an -nonconvexity point of the set if any -dimensional plane passing through the point intersects the set. It is proved that any closed, weakly -convex set in with non-empty set of -nonconvexity points consists of not less than three connected components. It is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Advanced Topology and Set Theory · Computational Geometry and Mesh Generation
