2000 character limit reached
Lipschitz null-homotopy of mappings $S^3 \rightarrow S^2$
Published 6 Nov 2018 in math.GT | (1811.02606v3)
Abstract: This work focuses on important step in quantitative topology: given homotopic mappings from $Sm$ to $Sn$ of Lipschitz constant $L$, build the (asymptotically) simplest homotopy between them (meaning having the least Lipschitz constant). The present paper resolves this problem for the first case where Hopf invariant plays a role: $m = 3$, $n = 2$, constructing a homotopy with Lipschitz constant $O(L)$
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.