A Lower Bound on the Growth of Minimal Graphs

IF 0.6 4区数学 Q3 MATHEMATICS

Computational Methods and Function Theory Pub Date : 2024-04-06 DOI:10.1007/s40315-024-00532-9

Allen Weitsman

引用次数: 0

Abstract

We show that for minimal graphs in \(R^3\) having 0 boundary values over simpy connected domains, the maximum over circles of radius r must be at least of the order \(r^{1/2}\).

查看原文本刊更多论文

最小图增长的下限

我们证明，对于在简单连通域上边界值为 0 的 \(R^3\) 中的最小图，半径为 r 的圆上的最大值必须至少是 \(r^{1/2}\) 的数量级。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Computational Methods and Function Theory MATHEMATICS, APPLIED-MATHEMATICS

CiteScore

3.20

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： CMFT is an international mathematics journal which publishes carefully selected original research papers in complex analysis (in a broad sense), and on applications or computational methods related to complex analysis. Survey articles of high standard and current interest can be considered for publication as well.