Disjoint minimal graphs
Differential Geometry
2009-03-01 v1 Analysis of PDEs
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).
Cite
@article{arxiv.0807.3694,
title = {Disjoint minimal graphs},
author = {Vladimir G. Tkachev},
journal= {arXiv preprint arXiv:0807.3694},
year = {2009}
}
Comments
14 pages