Minimal Graphs and Graphical Mean Curvature Flow in M × R

Abstract

In this paper, we investigate the problem of finding minimal graphs in Mn× R with general boundary conditions using a variational approach. We look at so called generalized solutions of the Dirichlet Problem that minimize a functional adapted from the area functional. We construct barriers to show that for certain conditions on our boundary data, φ(x), the solutions obtain the boundary data φ(x). Following Oliker-Ural'tseva we also consider solutions uε of a perturbed mean curvature flow for ε > 0. We show that there are subsequences εi where uεi converges to a function u satisfying the mean curvature flow, and subsequences u(·, ti) converge to a generalized solution u of the Dirichlet problem. Furthermore, u depends only on the choice of sequence εi.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…