University of Cambridge > Talks.cam > Geometric Analysis & Partial Differential Equations seminar > Regularity of minimal submanifolds and mean curvature flows meeting along a common free boundary

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Regularity of minimal submanifolds and mean curvature flows meeting along a common free boundary

Download to your calendar using vCal

  • UserBrian Krummel (UT, Austin)
  • ClockMonday 31 October 2016, 15:00-16:00
  • HouseCMS, MR13.

If you have a question about this talk, please contact Prof. Neshan Wickramasekera .

We consider the higher regularity of a minimal submanifold $M$ in a Riemannian manifold $N$ such that $M$ is the union of submanifolds-with-boundary $M_1,â€Ļ,M_q$ meeting along a common boundary $\Gamma$.  When $N$ is smooth (real-analytic), we show that $M_1,â€Ļ,M_q$ and $\Gamma$ are smooth (real-analytic) submanifolds.  This result was previously proven by Kindlerher, Nirenberg, and Spruck in the special case $q = 3$ and codimension one using a partial holograph transformation.  We extend their result to all $q \geq 3$ and all codimensions.  We then apply the result to the work of Wickramasekera and Hughes on minimal submanifolds and joint work of Schultz and White on network flows.

This talk is part of the Geometric Analysis & Partial Differential Equations seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 9204.53132118 kWh Lecture Block, Room 1, Sidgwick Site Faculty of History, Board Room

Other talks

Synthesizing Diverse Policies for Multi-Agent Coordination Talk title TBC LMB Seminar - Mechanisms of mRNA packaging and export Polar Oceans Seminar Talk Title abstract tbc Favourite Plants: the common, the captivating, and the curious
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity