arXiv research

The so called Jenkins-Serrin problem is a kind of Dirichlet problem for graphs with prescribed mean curvature that combines, at the same time, continuous boundary data with regions of the boundary where the boundary values explodes either to $+\infty$ or to $-\infty.$ We give a survey on the development of Jenkins-Serr…

Proves existence of translating solitons in product manifolds.

We extend Osserman's lemma on the generalized Gauss map of two-dimensional minimal graphs of higher codimension, construct a Jenkins-Serrin type special Lagrangian Scherk graph explicitly, and generalize Calabi's correspondence between minimal graphs and maximal graphs.

Solves Jenkins-Serrin problem in 3-manifolds with Killing vector fields.

We prove that any non-simply connected planar domain can be properly and minimally embedded in H^2 x R. The examples that we produce are vertical bi-graphs, and they are obtained from the conjugate surface of a Jenkins-Serrin graph.

In this paper we find functions over bounded domains in the 2-dimensional Euclidean space, whose graphs (in the Heisenberg space) has constant mean curvature different from zero and taking on (possibly) infinite boundary values over the boundary of the domain.

We describe the family of minimal graphs on strips with boundary values $\pm\infty$ disposed alternately on edges of length one, and whose conjugate graphs are contained in horizontal slabs of width one in $\mathbb{R}^3$. We can obtain as limits of such graphs the helicoid, all the doubly periodic Scherk minimal surfac…

A version of the Jenkins-Serrin theorem for the existence of CMC graphs over bounded domains with infinite boundary data in Sol$_3$ is proved. Moreover, we construct examples of admissible domains where the results may be applied.

Proof of Schwarz principle for specific minimal surfaces.

We construct harmonic diffeomorphisms from the complex plane $C$ onto any Hadamard surface $M$ whose curvature is bounded above by a negative constant. For that, we prove a Jenkins-Serrin type theorem for minimal graphs in $M\times R$ over domains of $M$ bounded by ideal geodesic polygons and show the existence of a se…

Let (M, g, k) be an initial data set for the Einstein equations of general relativity. We prove that there exist solutions of the Plateau problem for marginally outer trapped surfaces (MOTSs) that are stable in the sense of MOTSs. This answers a question of G. Galloway and N. O'Murchadha and is an ingredient in the pro…

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 develop the machinery necessary to prove a Jenkins-Serrin type theorem for solutions …

In this paper, we build properly embedded singly periodic minimal surfaces which have infinite total curvature in the quotient by the period. These surfaces are constructed by adding a handle to the toroidal half-plane layers defined by H. Karcher. The technics that use is to solve a Jenkins-Serrin problem over a strip…

We study the Dirichlet problem for minimal surface systems in arbitrary dimension and codimension via mean curvature flow, and obtain the existence of minimal graphs over arbitrary mean convex bounded $C^2$ domains for a large class of prescribed boundary data. This result can be seen as a natural generalization of the…

In this note we discuss graphs over a domain $Ω\subset N^2$ in the product manifold $N^2\times \mathbb{R}$. Here $N^2$ is a complete Riemannian surface and $Ω$ has peice-wise smooth boundary. Let $γ\subset\partialΩ$ be a smooth connected arc and $Σ$ be a complete graph in $N^2\times \mathbb{R}$ over $Ω$. We show that i…

We study the problem of finding a minimal graph with prescribed boundary data in arbitrary dimension and codimension. Existence, uniqueness, stability and regularity are treated. We first present the well-known results for codimension one: Jenkins-Serrin's existence theorem, convexity properties of the area which give …

In this paper, we study the Dirichlet problem for the minimal surface equation in $\rm Sol_3$ with possible infinite boundary data, where $\rm Sol_3$ is the non-abelian solvable $3$-dimensional Lie group equipped with its usual left-invariant metric that makes it into a model space for one of the eight Thurston geometr…

Given k>=2, we construct a (2k-2)-parameter family of properly embedded minimal surfaces in H^2 x R invariant by a vertical translation T, called Saddle Towers, which have total intrinsic curvature 4 pi(1-k), genus zero and 2k vertical Scherk-type ends in the quotient by T. As limits of those Saddle Towers, we obtain J…

In this paper, we study existence and uniqueness of solutions to Jenkins-Serrin type problems on domains in a Riemannian surface. In the case of unbounded domains, the study is focused on the hyperbolic plane.

Motivated by Ilmanen's correspondence, we present an explicit solution to the prescribed Hoffman-Osserman Gauss map problem for non-minimal translators to the mean curvature flow in Euclidean 4-space. We propose a conjecture on the non-existence of Jenkins-Serrin type unit-speed graphical translators.

Alternative solvability criterion for minimal surface equations and mean curvature flow.

Sharp solvability criteria found for Dirichlet problems in Riemannian manifolds.

Line graph transformation aids graph isomorphism tests by excluding challenging graph properties.

Proposes MGMN for end-to-end graph similarity learning.

GWNN uses graph wavelets for efficient graph CNNs.

The paper explores graphons of line graphs from sparse finite graphs.

edGNN improves graph embeddings for directed labeled graphs.

MxPool learns graph features from diverse graphs using a hierarchical structure.

Study the geometry of graph product extension graphs.

Graph neural network learns graph distances effectively.

UGRAPHEMB embeds graphs into vectors preserving their proximity, achieving competitive results.

Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.

Deep Divergence Graph Kernels learn graph representations without supervision.

Customized-GNN generates model-specific for each graph.

GRAPH-BERT uses only attention for graph representation learning.

Graph embedding leaks sensitive graph properties and subgraphs.

Characterizes graphs with leveled embeddings and introduces new graph invariants.

The paper shows conflict graphs of Petersen family graphs are mostly unbalanced.

HGP-SL pools and learns graph structure for hierarchical representation learning.

GSimCNN predicts graph similarity using CNNs, outperforming existing methods.

Two new methods improve graph embedding without needing a complete graph structure.

We define a pseudo-inverse for line graphs using linear integer programming.

HaarPooling compresses graphs by Haar transforms, improving graph classification and regression.

New graph kernel scales well with graph size and number, achieving state-of-the-art performance.

RL-VAE uses RL to decode molecular graphs from latent embeddings.

Develops method to create non-Abelian Ricci-flat graphs via bundles.

MathNet uses wavelets for graph representation and learning.

New method assesses graph generators using graph classifiers.