Counting ends on shrinkers

preprint2022arXivOpen access

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 this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.