The L1-relaxed area of the graph of the vortex map: optimal upper bound
Abstract
We compute an upper bound for the value of the L1-relaxed area of the graph of the vortex map u : Bl(0)⊂ R2 R2, u(x):= x/ x, x ≠ 0, for all values of l>0. Together with a previously proven lower bound, this upper bound turns out to be optimal. Interestingly, for the radius l in a certain range, in particular l not too large, a Plateau-type problem, having as solution a sort of catenoid constrained to contain a segment, has to be solved.
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.