Related papers: The non-parametric problem of Plateau in arbitrary…

We study the Wasserstein Hamiltonian flow with a common noise on the density manifold of a finite graph. Under the framework of stochastic variational principle, we first develop the formulation of stochastic Wasserstein Hamiltonian flow…

In this paper we study the global regularity for the solution to the Dirichlet problem of the equation of minimal graphs over a convex domain in hyperbolic spaces. We find that the global regularity depends only on the convexity of the…

In this article, we study the Lipschitz Geometry at infinity of complex analytic sets and we obtain results on algebraicity of analytic sets and on Bernstein's problem. Moser's Bernstein Theorem says that a minimal hypersurface which is a…

We prove full boundary regularity for minimizing biharmonic maps with smooth Dirichlet boundary conditions. Our result, similarly as in the case of harmonic maps, is based on the nonexistence of nonconstant boundary tangent maps. With the…

We study the two dimensional least gradient problem in a convex polygonal set in the plane. We show existence of solutions when the boundary data are attained in the trace sense. Due to the lack of strict convexity, the classical results…

This article deals with the existence of hypersurfaces minimizing general shape functionals under certain geometric constraints. We consider as admissible shapes orientable hypersurfaces satisfying a so-called reach condition, also known as…

We consider the nonparametric regression problem when the covariates are located on an unknown smooth compact submanifold of a Euclidean space. Under defining a random geometric graph structure over the covariates we analyze the asymptotic…

In this paper, we study minimizers of the Chon\'e--Rochet variational problem in dimension two. We first establish global $C^1$ regularity on arbitrary bounded convex domains, and then prove global $C^{1,1}$ regularity on bounded strictly…

One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…

We prove that the Gauss curvature and the curvature of the normal connection of any minimal surface in the four dimensional Euclidean space satisfy an inequality, which generates two classes of minimal surfaces: minimal surfaces of general…

For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…

Let S be a C^2 H-minimal noncharacteristic hypersurface in the first Heisenberg group. We show that if S contains a graphical strip, then it is not a stable minimal surface. Moreover, we show that if S is a C^2 H-minimal noncharacteristic…

We study minimal graphs in the homogeneous Riemannian 3-manifold $\widetilde{PSL_2(\mathbb{R})}$ and we give examples of invariant surfaces. We derive a gradient estimate for solutions of the minimal surface equation in this space and…

Ramsey's theorem, concerning the guarantee of certain monochromatic patterns in large enough edge-coloured complete graphs, is a fundamental result in combinatorial mathematics. In this work, we highlight the connection between this…

We will study the $1$-weighted Ricci curvature in view of the extrinsic geometric analysis. We derive several geometric consequences concerning stable weighted minimal hypersurfaces in weighted manifolds under a lower $1$-weighted Ricci…

A minimum dominating set in a graph is a minimum set of vertices such that every vertex of the graph either belongs to it, or is adjacent to one vertex of this set. This mathematical object is of high relevance in a number of applications…

Differently from their classical counterpart, nonlocal minimal surfaces are known to present boundary discontinuities, by sticking at the boundary of smooth domains. It has been observed numerically by J. P. Borthagaray, W. Li, and R. H.…

Minimax optimization problems are an important class of optimization problems arising from both modern machine learning and from traditional research areas. We focus on the stability of constrained minimax optimization problems based on the…

We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the known…

Lipschitz continuity of algorithms, introduced by Kumabe and Yoshida (FOCS'23), measures the stability of an algorithm against small input perturbations. Algorithms with small Lipschitz continuity are desirable, as they ensure reliable…