Convex combinations of minimal graphs (Q456558)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convex combinations of minimal graphs |
scientific article; zbMATH DE number 6093855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex combinations of minimal graphs |
scientific article; zbMATH DE number 6093855 |
Statements
Convex combinations of minimal graphs (English)
0 references
16 October 2012
0 references
Summary: Given a collection of minimal graphs, \(M_1, M_2, \dots, M_n\), with isothermal parametrizations in terms of the Gauss map and height differential, we give sufficient conditions on \(M_1, M_2, \dots, M_n\) 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.
0 references
Scherk's doubly periodic surface
0 references
catenoid surface
0 references
Enneper's surface
0 references
0.7464895248413086
0 references
0.7340026497840881
0 references
0.7235228419303894
0 references
0.7223332524299622
0 references
0.709748387336731
0 references
