vix.ing · top · new · best · stats · spec

Minimal graphs in Hn xR and Rn+1

2009/08/28 by Ricardo Sá Earp, Earp, Ricardo Sá, Éric Toubiana +1
Computer Science · Mathematics · #Advanced Mathematical Modeling in Engineering #Analysis of PDEs (math.AP) #Differential Geometry (math.DG) #FOS: Mathematics #Geometric Analysis and Curvature Flows #Nonlinear Partial Differential Equations

paper · pdf · doi:10.48550/arxiv.0908.4170

openalex publication_date 2009/08/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We construct geometric barriers for minimal graphs in Hn xR. We prove the existence and uniqueness of a solution of the vertical minimal equation in the interior of a convex polyhedron in Hn extending continuously to the interior of each face, taking infinite boundary data on one face and zero boundary value data on the other faces. In Hn xR, we solve the Dirichlet problem for the vertical minimal equation in a C0 convex domain taking arbitrarily continuous finite boundary and asymptotic boundary data. We prove the existence of another Scherk type hypersurface, given by the solution of the vertical minimal equation in the interior of certain admissible polyhedron taking alternatively infinite values +∞ and -∞ on adjacent faces of this polyhedron. Those polyhedra may be chosen convex or non convex. We establish analogous results for minimal graphs when the ambient is the Euclidean space R^ n+1.

Related