University of Cambridge > Talks.cam > Differential Geometry and Topology Seminar > On the cohomology of arithmetic hyperbolic manifolds

  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

On the cohomology of arithmetic hyperbolic manifolds

Download to your calendar using vCal

  • UserNicolas Bergeron, Jussieu
  • ClockWednesday 27 October 2010, 16:00-17:00
  • HouseMR13.

If you have a question about this talk, please contact Ivan Smith .

James Arthur has obtained spectacular classification results for the automorphic representations of classical groups. These have deep consequences for the topology of arithmetic real hyperbolic manifolds, enabling one (1) to give relations between the cohomology of an arithmetic hyperbolic manifold and its totally geodesic submanifolds (j.w. Laurent Clozel), (2) to construct arithmetic hyperbolic manifolds for which any congruence cover has zero first Betti number (j.w. Laurent Clozel) and (3) to represent small degree cohomology classes as linear combinations of totally geodesic manifolds (j.w. Colette Moeglin and John Millson). I will describe these results and explain their relations with Arthur’s work.

This talk is part of the Differential Geometry and Topology Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Webinar & GN06, Computer Laboratory, William Gates Building. Bateman Room, Gonville & Caius College Winstanley Lecture Theatre, Trinity College, Cambridge

Other talks

Group Work CSAR lecture: Decarbonizing road freight (TBC) Group Work Title to be confirmed C2D3 Computational Biology Annual Symposium 2026 Unveiling the curtain with ukubuyisa or go lata: complicated roles of museums and nation states in the cultural repatriation discourse and practice in southern Africa
 

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