Indexed metadata
Remarks on the disjoint minimal graphs conjecture
Allen Weitsman
Source abstract
It is known that there can be at most 3 disjoint nontrivial minimal graphs in R^3 with 0 boundary values, and conjectured that there can be at most 2. We explore properties that the graphs would have if there were 3.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.