Degree of Ball Maps with Maximum Geometric Rank
Abstract
This work focuses on the degree bound of maps between balls with maximum geometric rank and minimum target dimension where this geometric rank occurs. Specifically, we show that rational proper maps between Bn and BN with n ≥ 2, N = n(n+1)2, and geometric rank n-1 cannot have a degree of more than n+1.
0
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.