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

  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

Computing Kazhdan constants by computer.

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Keyn The Cambridge/Homerton Research and Teaching Centre for Children’s Literature SS03, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

The spread of environmental cost-benefit analysis in UK government, c.1966-1995: representing the public in the Anthropocene Title tbc Online Causal Inference Seminar An Amphibious Urbanism | | Cut 4: The Desert Arrives Slowly Sheref Mansy, topic TBA Morning Tea and Coffee
 

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