Convexity, critical points, and connectivity radius

DOI10.1090/PROC/14892zbMATH Open1434.53045arXiv1910.02432OpenAlexW2982590710WikidataQ126862566 ScholiaQ126862566MaRDI QIDQ5212433FDOQ5212433

Authors: Mikhail G. Katz 

Publication date: 29 January 2020

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Abstract: We study the level sets of the distance function from a boundary point of a convex set in Euclidean space. We provide a lower bound for the range of connectivity of the level sets, in terms of the critical points of the distance function in the sense of Grove-Shiohama-Gromov-Cheeger.

Full work available at URL: https://arxiv.org/abs/1910.02432

Recommendations

• scientific article; zbMATH DE number 737509
• SMALLNESS OF THE SET OF CRITICAL VALUES OF DISTANCE FUNCTIONS IN TWO‐DIMENSIONAL EUCLIDEAN AND RIEMANNIAN SPACES
• On the topology of the effective subsets of level sets
• Convexity of level sets and a two-point function
• Critical values and level sets of distance functions in Riemannian, Alexandrov and Minkowski spaces

zbMATH Keywords

critical pointconvex setsMorse theory

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Global geometric and topological methods (à la Gromov); differential geometric analysis on metric spaces (53C23)

Cites Work

• A generalized sphere theorem
• Curvature, diameter and Betti numbers
• Diameter-extremal subsets of spheres
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• On the topology of the effective subsets of level sets

This page was built for publication: Convexity, critical points, and connectivity radius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212433)