Disjoint minimal graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Differential Geometry, Analysis of PDEs, 53A10; 35J60

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/221677

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0807.3694
 http://arxiv.org/abs/0807.3694
 Annals of Global Analysis and Geometry, 35(2009), no 2, 139-155
 doi:10.1007/s10455-008-9127-7

Collections

arXiv