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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

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 INI IT.

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.

Other lists

Philosophical Approaches to Education seminar series External Seminar RECOUP Seminars Wireless Communications Team Seminars Algebra and Representation Theory Seminar Cambridge Statistics Discussion Group (CSDG)

Other talks

Disaggregating goods Roland the Hero Stopping the Biological Clock – The Lazarus factor and Pulling Life back from the Edge. The Design of Resilient Engineering Infrastructure Systems with Bayesian Networks Localization estimates for hypoelliptic equations Immigration policy-making beyond 'Western liberal democracies'
 

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