arXiv · 2112.06158
Counting ends on shrinkers
Abstract
In this paper we apply a geometric covering method to study the number of ends on shrinkers. On one hand, we prove that the number of ends on any complete non-compact shrinker is at most polynomial growth with fixed degree. On the other hand, we prove that any complete non-compact shrinker with certain volume comparison condition has finitely many ends. Some special cases of shrinkers are also discussed.
Explore related subjects
Keep this discovery
Jia-Yong Wu. 2021-12-12. Counting ends on shrinkers. https://arxiv.org/abs/2112.06158
Cite the original work for its findings. Save a collection to share your selection of sources.