Meeks’ conjecture on disjoint minimal graphs
For every integer , consider pairs where is a domain and is a nontrivial solution of the minimal surface equation in , satisfying on . If the corresponding minimal graphs are pairwise disjoint, then there are at most two such pairs .
References
- On Meeks' conjecture on disjoint minimal graphs — arXiv — Angelo Benedetti, Barbara Nelli
Source: arXiv
Progress summary
A new unrefereed paper proves the conjecture only under extra growth conditions, so the unrestricted question remains open.
Meeks’ conjecture asks whether disjoint nonplanar minimal graphs are limited in number, notably to in the two-dimensional setting. The unrestricted conjecture is not settled.
Known results
- Meeks–Rosenberg: finiteness under bounded-gradient assumptions.
- Li–Wang: bound for two-dimensional minimal graphs in , without a growth assumption.
- Tkachev, 2009: bound using angular density.
- Zhou, 2011: bound when Gaussian curvature tends to zero at infinity, including sublinear growth.
October 2026 conditional advance
Angelo Benedetti and Barbara Nelli claim complementary growth-case results and asymptotic-angle estimates. This is progress toward Meeks’ conjecture, but the unrestricted statement remains open and the claim is unrefereed.
Current status (as of October 2026): conditional bounds and earlier partial results are known, while the unrestricted conjecture remains open.
Solutions 0
No solutions have been posted yet.