Disjoint minimal graphs
arXiv:0807.3694 · doi:10.1007/s10455-008-9127-7
Abstract
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).
14 pages