Convex Combinations of Minimal GraphsReportar como inadecuado

Convex Combinations of Minimal Graphs - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

International Journal of Mathematics and Mathematical SciencesVolume 2012 2012, Article ID 724268, 9 pages

Research Article

Department of Mathematics, Brigham Young University, Provo, UT 84602, USA

Department of Mathematics, Maria Curie-Sklodowska University, 20-031 Lublin, Poland

Received 11 May 2012; Accepted 14 July 2012

Academic Editor: Ilya M. Spitkovsky

Copyright © 2012 Michael Dorff et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Given a collection of minimal graphs, , with isothermal parametrizations in terms of the Gauss map and height differential, we give sufficient conditions on so that a convex combination of them will be a minimal graph. We will then provide two examples, taking a convex combination of Scherk-s doubly periodic surface with the catenoid and Enneper-s surface, respectively.

Autor: Michael Dorff, Ryan Viertel, and Magdalena Wołoszkiewicz



Documentos relacionados