pith. sign in

arxiv: 1312.7387 · v1 · pith:TEFMJNX5new · submitted 2013-12-28 · 🧮 math.DG

Bernstein type theorem for entire weighted minimal graphs in mathbb{G}^ntimesmathbb{R}

classification 🧮 math.DG
keywords mathbbbernsteinentiregraphsminimaltheoremtypeargument
0
0 comments X
read the original abstract

Based on a calibration argument, we prove a Bernstein type theorem for entire minimal graphs over Gauss space $\mathbb{G}^n$ by a simple proof.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.