相关论文: The $L^1$-relaxed area of the graph of the vortex …

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…

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 $\Omega \subset \mathbb R^2$ of radius $l$, we perform a careful…

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…

We compute the relaxed Cartesian area for general $0$-homogeneous map of bounded variation, with respect to the strict $BV$-convergence. In particular, we show that the relaxed area is finite for this class of maps and we provide an…

We compute the relaxed Cartesian area in the strict $BV$-convergence on a class of piecewise Lipschitz maps from the plane to the plane, having jump made of several curves allowed to meet at a finite number of junction points. We show that…

In this paper we provide an estimate from above for the value of the relaxed area functional for a map defined on a bounded domain of the plane with values in the plane and discontinuous on a regular simple curve with two endpoints. We show…

Given a bounded open set $\Omega \subset \mathbb{R}^2$, we study the relaxation of the nonparametric area functional in the strict topology in $BV(\Omega;\mathbb{R}^2)$, and compute it for vortex-type maps, and more generally for maps in…

Plateau's problem is not a single conjecture or theorem, but rather an abstract framework, encompassing a number of different problems in several related areas of mathematics. In its most general form, Plateau's problem is to find an…

We consider an overdetermined elliptic problem known as the hollow vortex problem. We prove that the solutions to this problem are in 1:1 correspondence with minimal graphs bounded by horizontal symmetry lines. We use this correspondence to…

In this paper we study the problem \[ \begin{cases} -\Delta_d u = \mu_0 &\text{ in } G\\ u = 0 &\text{ on } \partial G \end{cases} \] where, $\Delta_d$ represent the discret Laplacian, and $\mu_0$ it is a measure defined in the vertex of…

The number of distinct maps (pre-maps) with a single vertex and valence $d$ is computed for any value of $d$. The types of maps (pre-maps) that we consider depend on whether the underlaying graph (pre-graph) is signed or unsigned and…

For an unmixed bipartite graph $G$ we consider the lattice of vertex covers $\mathcal{L}_G$ and compute depth, projective dimension and extremal Betti-numbers of $R/I(G)$ in terms of this lattice.

We consider a relaxed notion of energy of non-parametric codimension one surfaces that takes account of area, mean curvature, and Gauss curvature. It is given by the best value obtained by approximation with inscribed polyhedral surfaces.…

We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…

In this paper we investigate the distribution of the set of values of a linear map at integer points on a quadratic surface. In particular we show that this set is dense in the range of the linear map subject to certain algebraic conditions…

We study the Euler equations on a rotating unit sphere, focusing on the dynamics of vortex caps. Leveraging the $L^1$-stability of monotone, longitude-independent profiles, we demonstrate that certain ill-prepared initial data within the…

A $k$-L(2,1)-labeling of a graph is a function from its vertex set into the set $\{0,...,k\}$, such that the labels assigned to adjacent vertices differ by at least 2, and labels assigned to vertices of distance 2 are different. It is known…

We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…

The $E = 0$ octet of bilayer graphene in the filling factor range of -4 < $\nu$ < 4 is a fertile playground for many-body phenomena, yet a Landau level diagram is missing due to strong interactions and competing quantum degrees of freedom.…

In the k-Apex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor closed class of graphs, hence by the deep results of Robertson and Seymour,…