Two dimensional disjoint minimal graphs
Abstract
In this paper, under the assumption of Gauss curvature vanishing at infinity, we will prove Meeks' conjecture: the number of disjointly supported minimal graphs in R3 is at most two.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.