University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Vectorial metric compactification of symmetric spaces and affine buildings

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹ️ Information

Vectorial metric compactification of symmetric spaces and affine buildings

Download to your calendar using vCal

If you have a question about this talk, please contact INI IT .

NPCW04 - Approximation, deformation, quasification

 In higher rank symmetric spaces and affine buildings, the natural
projection of segments in a closed Weyl chamber may be regarded as a
universal metric with vectorial values. It refines all Finsler
metrics.  Remarkably, many of the traditional basic properties of
CAT spaces still hold for the vectorial metric, providing similar
properties for all Finsler metrics in a unified way.  We will show
that the classical Busemann compactification construction can be
directly conducted in this context, giving a natural compactification
by vector-valued horofunctions.  These functions correspond to
strongly asymptotic classes of facets.  This compactification is
naturally homeomorphic to the maximal Satake compactification and
dominates all linear Finsler compactifications.


This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge Regional College, CB4 2QT Lecture Theatre, St John's Divinity School, Cambridge Dept of Chemistry, Todd Hamied Room

Other talks

On convective penetration of a buoyant plume into a stably stratified layer Tea and Coffee Break Machine Learning for Spectral Geometry and Vice Versa Title to be confirmed From Physics-informed Neural Networks to Numerically Verified Proofs in Geometric Analysis Cambridge RNA Club - ONLINE
 

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