COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Random rigidity in the free groupAdd to your list(s) Download to your calendar using vCal - Danny Calegari (Cambridge)
- Tuesday 28 February 2012, 14:15-15:15
- MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.
If you have a question about this talk, please contact grg1000. This talk has been canceled/deleted If G is a group, and [G,G] is its commutator subgroup, the commutator length of an element w (denoted cl(w)) is the least number of commutators in G whose product is w; and the stable commutator length scl(w) is the limit of cl(w^n)/n as n goes to infinity. Stable commutator length is related to bounded cohomology and quasimorphisms, but is notoriously difficult to calculate exactly, or even to approximate. However, we show that in a free group F of rank k a random word w of length n (conditioned to lie in [F,F]) has scl(w) = log(2k-1) n / 6 log(n) + o(n / log(n)) with high probability. The proof combines elements from ergodic theory and combinatorics. This is joint work with Alden Walker. This talk is part of the Probability series. ## This talk is included in these lists:This talk is not included in any other list Note that ex-directory lists are not shown. |
## Other listsComputer Science Essentials Peptide Mini-Symposium J## Other talksSynthesising Provably Correct Controllers for Manufacturing Art for the new society: Russian art in the service of the Revolution Artists’ Session: In pursuit of tipping point Information Theory It takes two to tango:platelet collagen receptor GPVI-dimer in thrombosis and clinical implications Black and British Migration |