arXiv subjects

Alaa Elshorbagy

Publications and source records attributed to Alaa Elshorbagy.

4 recordsLinked to original sources

arXiv2024

Relaxation of the area of the vortex map: a non-parametric Plateau problem for a catenoid containing a segment

Motivated by the study of the non-parametric area $\mathcal A$ of the graph of the vortex map $u$ (a two-codimensional singular surface in $\mathbb R^4$) over the disc $Ω\subset \mathbb R^2$ of radius $l$, we perform a careful analysis of the singular part of the relaxation of $\mathcal A$ computed at $u$. The precise description is given in terms of a area-minimizing surface in a vertical copy of $\mathbb R^3 \subset \mathbb R^4$, which is a sort of ``catenoid'' containing a segment corresponding to a radius of $Ω$. The problem involves an area-minimization with a free boundary part; several boundary regularity properties of the minimizer are inspected.

math.AP↗

arXiv2024

The $L^1$-relaxed area of the graph of the vortex map: optimal upper bound

We compute an upper bound for the value of the $L^1$-relaxed area of the graph of the vortex map $u : B_l(0)\subset \mathbb R^2 \to \mathbb R^2$, $u(x):= x/\vert x\vert$, $x \neq 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.

math.AP↗

arXiv2021

The $L^1$-relaxed area of the graph of the vortex map

We compute the value of the $L^1$-relaxed area of the graph of the map $u : B_l(0)\subset \mathbb R^2 \mapsto \mathbb R^2$, $u(x):= x/\vert x\vert$, $x \neq 0$, for all values of $l>0$. Interestingly, for $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.

math.AP↗

arXiv2019

On the relaxed area of the graph of discontinuous maps from the plane to the plane taking three values with no symmetry assumptions

In this paper we estimate from above the area of the graph of a singular map $u$ taking a disk to three vectors, the vertices of a triangle, and jumping along three $\mathcal{C}^2-$ embedded curves that meet transversely at only one point of the disk. We show that the relaxed area can be estimated from above by the solution of a Plateau-type problem involving three entangled nonparametric area-minimizing surfaces. The idea is to "fill the hole" in the graph of the singular map with a sequence of approximating smooth two-codimensional surfaces of graph-type, by imagining three minimal surfaces, placed vertically over the jump of $u$, coupled together via a triple point in the target triangle. Such a construction depends on the choice of a target triple point, and on a connection passing through it, which dictate the boundary condition for the three minimal surfaces. We show that the singular part of the relaxed area of $u$ cannot be larger than what we obtain by minimizing over all possible target triple points and all corresponding connections.

math.AP↗