University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Computing Kazhdan constants by computer.

Computing Kazhdan constants by computer.

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact info@newton.ac.uk.

NPC - Non-positive curvature group actions and cohomology

Ozawa found a new characterization of property (T) of finitely generated groups. His theorem gives an algorithm to compute a lower bound of the Kazhdan constant. Netzer-Thom actually found a good positive lower bound for SL(3,Z). I will report on computer experiments on other examples. We found good lower bounds for lattice groups on A2-tilde buildings, which have property (T). This is an experimental math talk.



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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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