University of Cambridge > Talks.cam > Geometric Group Theory (GGT) Seminar > Girth of random Cayley graphs

  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

Girth of random Cayley graphs

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

If you have a question about this talk, please contact Maurice Chiodo.

I will discuss some estimates for the girth of Cayley graphs with respect to randomly chosen generators. I will talk about a problem motivated by a question asked by Henry Wilton on the construction of certain expander graphs. Then time permitting, I will talk about older results from a paper of Gamburd, Hoory, Shahshahani, Shalev and Virag.

This talk is part of the Geometric Group Theory (GGT) Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Religion, Conflict and its Aftermath Booking Required - Computing/IT Courses at the CMS Managing Open Data with an Industrial Partner Physics of Living Matter - PLM Emmy Noether Society Life Science Interface Seminars

Other talks

Polynomial approximation of high-dimensional functions on irregular domains A Bourdiesian analysis of songwriting habitus Cohomology of the moduli space of curves Investigation into appropriate statistical models for the analysis and visualisation of data captured in clinical trials using wearable sensors Kolmogorov Complexity and Gödel’s Incompleteness Theorems The world is not flat: towards 3D cell biology and 3D devices
 

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