arxiv: 2604.19630 · v1 · submitted 2026-04-21 · 🧮 math.DG · math.AP· math.CV

Recognition: unknown

An upper bound on the growth of minimal graphs

Allen Weitsman

Authors on Pith no claims yet

Pith reviewed 2026-05-10 01:10 UTC · model grok-4.3

classification 🧮 math.DG math.APmath.CV

keywords minimal surface equationminimal graphsgrowth boundssimply connected domainsexponential growthboundary value problems

0 comments

The pith

Solutions to the minimal surface equation over simply connected domains with zero boundary values grow at most exponentially.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that graphs solving the minimal surface equation over simply connected domains with zero boundary values cannot grow faster than exponentially. This bound limits how steeply the graph can rise away from the boundary. A reader would care because minimal graphs appear in geometry and physics as models for surfaces of least area, and growth controls help describe their global shape.

Core claim

Graphs of solutions to the minimal surface equation over simply connected domains with boundary values 0 can have at most exponential growth.

What carries the argument

Comparison principles or Harnack-type inequalities for the minimal surface equation that hold under the simply connected domain and zero boundary conditions.

If this is right

The height of such graphs is bounded by an expression of the form C e^{k r} where r is distance from the boundary.
The bound restricts possible asymptotic behaviors of the graph at large distances.
It supplies a tool for analyzing whether solutions can be continued or extended beyond the given domain.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same comparison methods might yield growth bounds for minimal graphs over domains with holes if extra symmetry is assumed.
Examples achieving exactly exponential growth would show the bound is sharp and worth constructing explicitly.
The result raises the question of how growth rates change when the zero boundary condition is relaxed to small values.

Load-bearing premise

The domain must be simply connected with boundary values exactly zero.

What would settle it

A solution to the minimal surface equation on a simply connected domain with zero boundary values that grows faster than any exponential function, such as double-exponentially, would disprove the bound.

read the original abstract

Graphs of solutions to the minimal surface equation over simply connected domains with boundary values 0 can have at most exponential growth.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives an exponential growth bound for minimal graphs over simply connected domains with zero boundary data using comparison principles, but the result looks like a direct application of known elliptic estimates rather than a major advance.

read the letter

The main point is that solutions to the minimal surface equation over simply connected plane domains, zero on the boundary, cannot grow faster than exponentially with distance to the boundary. The paper works out an explicit upper bound via Harnack inequalities and barrier comparisons tailored to the minimal surface operator. That is the concrete contribution on offer. The argument stays within classical PDE techniques for quasilinear elliptic equations, and the simply-connected assumption lets the authors avoid cut-off functions or local charts when applying the maximum principle. If the derivations in the middle sections hold up, the steps are standard and free of obvious circularity. The bound itself is stated cleanly and could serve as a reference for controlling solutions in related problems. The paper does not introduce new machinery or handle more general domains, so the novelty is limited to this specific setting. The soft spot is exactly the one flagged in the stress test: the comparison relies on simple connectivity to construct global barriers, and nothing is said about what happens on domains with holes or with small but nonzero boundary data. No examples on an annulus or numerical checks appear to test whether the constant stays controlled. The result is therefore narrow by design. This is a short note for people already working on growth estimates for minimal surfaces or related elliptic PDEs. A reader looking for a precise reference in that niche might find it useful, but it will not shift broader thinking in geometric analysis. The claim is well-posed and the setting is standard, so the paper deserves a serious referee even if the revisions end up being light.

Referee Report

2 major / 1 minor

Summary. The manuscript claims that graphs of solutions u to the minimal surface equation div(Du / sqrt(1 + |Du|^2)) = 0 over simply connected domains Ω ⊂ R² with u|∂Ω = 0 satisfy an exponential growth bound of the form |u(x)| ≤ C exp(κ dist(x, ∂Ω)) for constants C, κ depending on Ω.

Significance. If the central estimate holds, the result supplies a quantitative control on the height of minimal graphs under simple-connectivity and zero-boundary conditions. Such bounds are useful in geometric analysis for applying maximum principles and comparison techniques to minimal surfaces, and they complement existing Bernstein-type theorems by providing explicit growth rates near the boundary.

major comments (2)

[§§3–4] §§3–4: The exponential bound is obtained via a Harnack-type inequality or barrier comparison that is constructed under the global topological assumption that Ω is simply connected. The manuscript does not supply a self-contained argument showing why this assumption is required for the auxiliary function to satisfy the maximum principle without cut-offs, nor does it indicate how the constant κ would behave if the domain were allowed to have holes.
[Abstract] Abstract and §1: The claim is stated without an explicit statement of the dependence of C and κ on the geometry of Ω or on the minimal-surface operator, and no error estimates or numerical checks on model domains are provided. This makes it difficult to assess whether the bound remains uniform when the zero-boundary condition is relaxed to small data.

minor comments (1)

[§2] The notation for the distance function dist(x, ∂Ω) should be introduced once in §2 and used consistently; a short remark on the regularity assumed for ∂Ω would also help.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough reading and valuable comments on our manuscript. We address each major comment below and indicate the revisions we plan to make.

read point-by-point responses

Referee: [§§3–4] §§3–4: The exponential bound is obtained via a Harnack-type inequality or barrier comparison that is constructed under the global topological assumption that Ω is simply connected. The manuscript does not supply a self-contained argument showing why this assumption is required for the auxiliary function to satisfy the maximum principle without cut-offs, nor does it indicate how the constant κ would behave if the domain were allowed to have holes.

Authors: We agree that the role of simple connectivity deserves a more self-contained explanation. In the revised version we will add a paragraph in §3 that constructs the auxiliary function explicitly on the universal cover and shows that simple connectivity ensures it descends to a globally defined function on Ω satisfying the elliptic inequality without requiring cut-offs. This construction fails in the presence of holes because the distance function to the boundary cannot be extended consistently across non-contractible loops. We do not provide an analysis of how κ would scale with holes, as that would necessitate a different barrier construction adapted to the fundamental group; our result is stated only for simply connected domains. revision: partial
Referee: [Abstract] Abstract and §1: The claim is stated without an explicit statement of the dependence of C and κ on the geometry of Ω or on the minimal-surface operator, and no error estimates or numerical checks on model domains are provided. This makes it difficult to assess whether the bound remains uniform when the zero-boundary condition is relaxed to small data.

Authors: The constants C and κ depend on Ω through its inradius and the C^{2,α} norm of the boundary, which enter the construction of the comparison function in §4; we will state this dependence explicitly in the abstract and in the statement of the main theorem. The manuscript is devoted to the analytical derivation of the exponential bound and does not contain numerical experiments or error estimates. For small nonzero boundary data the same barrier comparison yields a similar growth estimate with constants that depend continuously on the boundary values, but a fully quantitative uniformity statement lies outside the scope of the present work. revision: partial

Circularity Check

0 steps flagged

No circularity: standard comparison principles yield the exponential bound independently

full rationale

The paper proves an exponential growth upper bound for solutions of the minimal surface equation over simply-connected domains with zero boundary data. The derivation chain relies on comparison principles, barrier functions, and Harnack inequalities that are classical tools in minimal surface theory and are not constructed from the target bound itself. No self-definitional steps appear (the growth rate is not used to define the equation or the domain class), no fitted parameters are relabeled as predictions, and no load-bearing self-citations or uniqueness theorems imported from prior work by the same author are invoked. The simple-connectedness hypothesis is an explicit topological assumption enabling global estimates rather than a hidden redefinition. The result is therefore self-contained and externally falsifiable via standard PDE techniques.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The result rests on standard properties of the minimal surface equation and domain assumptions typical in elliptic PDE theory.

axioms (1)

domain assumption The minimal surface equation satisfies a maximum principle or comparison principle over simply connected domains.
Invoked implicitly to derive the exponential growth bound from boundary data.

pith-pipeline@v0.9.0 · 5290 in / 938 out tokens · 29554 ms · 2026-05-10T01:10:35.102960+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

16 extracted references

[1]

Abu-Muhanna and A

Y. Abu-Muhanna and A. Lyzzaik,The Boundary behaviour of harmonic univalent maps, Pac. Jour. Math.141(1990), 1-20

1990
[2]

Duren,Harmonic mappings in the plane, Cambridge Tracts in Mathematics, 2004

P. Duren,Harmonic mappings in the plane, Cambridge Tracts in Mathematics, 2004

2004
[3]

Hayman,Meromorphic functions, Oxford University Press, 1975

W.K. Hayman,Meromorphic functions, Oxford University Press, 1975

1975
[4]

A.M.S.121(1994), 1027-1037

J-F Hwang,Growth Property for the minimal surface equation in unbounded domains, Proc. A.M.S.121(1994), 1027-1037

1994
[5]

Math.183 (1998), 91-102

J-F Hwang,Catenoid-like solutions for the minimal surface equation, Pacific Jour. Math.183 (1998), 91-102

1998
[6]

Lundberg and A

E. Lundberg and A. Weitsman,On the growth of solutions to the minimal surface equation over domains containing a half plane, Calc. Var. P.D.E.54(2015), no. 4, 3385–3395

2015
[7]

Lehto and K

O. Lehto and K. Virtanen,Quasiconformal mappings in the plane, Springer-Verlag, 1973

1973
[8]

Miklyukov,Some singularities in the behavior of solutions of equations of minimal surface type in unbounded domains, Math

V. Miklyukov,Some singularities in the behavior of solutions of equations of minimal surface type in unbounded domains, Math. USSR Sbornik44(1983), 61-73

1983
[9]

Rudin,Real and Complex Analysis, McGraw-Hill, 1987

W. Rudin,Real and Complex Analysis, McGraw-Hill, 1987

1987
[10]

Tkachev,Disjoint minimal graphs, Ann

V. Tkachev,Disjoint minimal graphs, Ann. Global Anal. Geom.35(2009) 108-123

2009
[11]

Tsuji,Potential Theory in Modern Function Theory, Maruzen Co., Ltd., Tokyo (1959)

M. Tsuji,Potential Theory in Modern Function Theory, Maruzen Co., Ltd., Tokyo (1959)

1959
[12]

Weitsman,On the growth of minimal graphs, Indiana Univ

A. Weitsman,On the growth of minimal graphs, Indiana Univ. Math. J.54(2005), 617-625

2005
[13]

Weitsman,Growth of solutions to the minimal surface equation over domains in a half plane, Communications in Analysis and Geometry13(2005), 1077-1087

A. Weitsman,Growth of solutions to the minimal surface equation over domains in a half plane, Communications in Analysis and Geometry13(2005), 1077-1087

2005
[14]

Weitsman,A sharp bound for the growth of minimal graphs, Comput

A. Weitsman,A sharp bound for the growth of minimal graphs, Comput. Methods Funct. Theory 21(2021), no. 4, 905–914. (Walter Hayman memorial issue)

2021
[15]

Weitsman,Level curves of minimal graphsComm

A. Weitsman,Level curves of minimal graphsComm. Anal. Geom.30(2022), no. 5, 1185–1192

2022
[16]

A. Weitsman,A lower bound on the growth of minimal graphsComputational Methods and Function Theory 2024 (Peter Duren memorial issue) Department of Mathematics, Purdue University, West Lafayette, IN 47907-1395 Email: weitsman@purdue.edu

2024