加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本