Convex Combinations of Minimal Graphs
Given a collection of minimal graphs, 𝑀1,𝑀2,…,𝑀𝑛, with isothermal parametrizations in terms of the Gauss map and height differential, we give sufficient conditions on 𝑀1,𝑀2,…,𝑀𝑛 so that a convex combination of them will be a minimal graph. We will then provide two examples, taking a convex combinati...
Main Authors: | Michael Dorff, Ryan Viertel, Magdalena Wołoszkiewicz |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2012-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/2012/724268 |
Similar Items
-
HIGHER ORDER SCHWARZIAN DERIVATIVES FOR CONVEX UNIVALENT FUNCTIOS
by: DORFF M., et al.
Published: (2008-01-01) -
Convex and Weakly Convex Domination in Prism Graphs
by: Rosicka Monika
Published: (2019-08-01) -
The Convexity Spectra and the Strong Convexity Spectra of Graphs
by: Pei-lan Yen, et al.
Published: (2005) -
Convex graph covers
by: Radu Buzatu, et al.
Published: (2015-11-01) -
Convex Graph Invariants
by: Chandrasekaran, Venkat, et al.
Published: (2012)