Minimal graphs in H^n xR and R^{n+1}

Details Minimal graphs in H^n xR and R^{n+1} Minimal graphs in H^n xR and R^{n+1}

2009-08-28

arxiv.org/abs/0908.4170v2

Mathematics

Differential Geometry

Scientific paper

We construct geometric barriers for minimal graphs in H^n xR. We prove the existence and uniqueness of a solution of the vertical minimal equation in the interior of a convex polyhedron in H^n 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 H^n xR, we solve the Dirichlet problem for the vertical minimal equation in a C^0 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 +\infty and -\infty 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}.

Affiliated with

Also associated with

No associations

Rating

Minimal graphs in H^n xR and R^{n+1} does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimal graphs in H^n xR and R^{n+1}, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal graphs in H^n xR and R^{n+1} will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-193400