Disjoint minimal graphs
Abstract
We prove that the number s(n) of disjoint minimal graphs supported on domains in Rn 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).
0
We prove that the number s(n) of disjoint minimal graphs supported on domains in Rn 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).