COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Geometric Group Theory (GGT) Seminar > The weight of groups and complexity of surface maps
The weight of groups and complexity of surface mapsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Francesco Fournier-Facio. The weight of a group is the minimal number of elements that normally generate the group. The (unsolved) Wiegold problem asks if there are finitely generated perfect groups with weight greater than one. It is conjectured that taking free products typically increases the weight, but there are limited tools for proving lower bounds of weights. I will explain how sharp lower bounds of a suitable complexity notion of surface maps (relative to the boundary) can be used to show some free products have weight greater than one. This relates the problem to the analogous spectral gap properties of stable commutator length (scl). I will sketch a method of Calegari proving spectral gaps of scl in hyperbolic manifold groups and explain how it can be adapted in the new setting. This talk is part of the Geometric Group Theory (GGT) Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCentre of African Studies Lent Seminar Series CJBS Marketing Group Seminars Davido's Major Individual Music Awards That Changed His LifeOther talksUnderstanding the cancer genome base-by-base CamLS Annual Symposium 2024 Generative AI in programming education: Bridging the gap from school to what lies ahead Alphafold2 at the LMB - Use and Applications Polynomial-Time Pseudodeterministic Construction of Primes |