University of Cambridge > Talks.cam > Geometric Analysis & Partial Differential Equations seminar > Minimizing the area of the Gauss map of surfaces in S3

  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

Minimizing the area of the Gauss map of surfaces in S3

Download to your calendar using vCal

If you have a question about this talk, please contact Giacomo Ageno .

For a closed embedded surface in the round 3-sphere, one can consider its Gauss map taking values in the Grassmannian of 2-planes in 4-space, and try to minimize its area among all surfaces of a given genus. We will present some motivations to study this functional, its relation to other variational problems, and a dichotomy between spheres, for which the infimum is achieved, and surfaces of genus g>0, for which there are no minimizers and minimizing sequences must degenerate. After describing some interesting ways in which this degeneration can occur, giving rise to a round sphere and g-1 small handles where the negative curvature concentrates, we will present a compactness result showing roughly that all minimizing sequences exhibit that behaviour. This is based on joint work with T. Riviere.

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

MedSoc Gates Scholars' Common Room, University Centre REGISTRATION REQUIRED: http://bit.ly/15Ftmpi

Other talks

Shining a light on the origin of supermassive black holes with cosmological simulations Peri-Operative Medicine, and Obstetrics and Gynaecology Welfare Reform and the Imperative of Cooperation The search for a new population of strong gravitational lenses with JWST Am I a Member? Auditing Private Machine Learning Title to be confirmed
 

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