The -relaxed area of the graph of the vortex map: optimal upper bound
arXiv:2409.18143
Abstract
We compute an upper bound for the value of the -relaxed area of the graph of the vortex map , , , for all values of . Together with a previously proven lower bound, this upper bound turns out to be optimal. Interestingly, for the radius in a certain range, in particular not too large, a Plateau-type problem, having as solution a sort of catenoid constrained to contain a segment, has to be solved.
arXiv admin note: substantial text overlap with arXiv:2107.07236