Papers
Topics
Authors
Recent
2000 character limit reached

Convexity, critical points, and connectivity radius

Published 6 Oct 2019 in math.DG | (1910.02432v2)

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.

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Authors (1)

  1. Mikhail G. Katz 

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up