Disjoint minimal graphs

Details Disjoint minimal graphs Disjoint minimal graphs

2008-07-23

arxiv.org/abs/0807.3694v1

Annals of Global Analysis and Geometry, 35(2009), no 2, 139-155

Mathematics

Differential Geometry

14 pages

Scientific paper

10.1007/s10455-008-9127-7

We prove that the number s(n) of disjoint minimal graphs supported on domains
in R^n is bounded by e(n+1)^2. In the two-dimensional case we show that s(2) is
at most three (the conjectured number is two).

Affiliated with

Also associated with

No associations

Rating

Disjoint minimal graphs 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 Disjoint minimal graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Disjoint minimal graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1189