On the minimality of pancake decomposition of surface germs
Abstract
The abnormal surfaces called snakes and circular snakes, defined in GabrielovSouza, are special types of surface germs capturing the outer Lipschitz phenomena relevant to the outer classification problem. We provide algorithms to obtain a minimal pancake decomposition, i.e., where the number of pancakes is minimal, for snakes and circular snakes. We call a pancake decomposition obtained from our algorithm a greedy pancake decomposition. We also prove that greedy pancake decompositions of weakly outer Lipschitz equivalent snakes (or circular snakes) are weakly equivalent, in the sense that there is a weakly outer bi-Lipschitz homeomorphism between the surfaces mapping each greedy pancake to a greedy pancake. This implies that such minimal decompositions are also canonical up to weakly outer bi-Lipschitz equivalence.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.