Rational maps admit a canonical decomposition of their pullback metrics into footballs, which implies that branch data consisting of k nontrivial partitions are realizable whenever k exceeds the shortest partition length by more than one.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.DG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Structure and realizability for rational maps
Rational maps admit a canonical decomposition of their pullback metrics into footballs, which implies that branch data consisting of k nontrivial partitions are realizable whenever k exceeds the shortest partition length by more than one.