Accessibility of partially acylindrical actions

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

• Michael Hill (University of Cambridge)
• Friday 30 October 2020, 13:45-14:45
• Zoom: https://maths-cam-ac-uk.zoom.us/j/91636583222.

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

A graph of groups is a common way of decomposing a group into subgroups. Suppose we are given a group G. A natural question to ask is if there is some bound on the complexity on a graph of groups decomposition for G. A basic example of a result in this direction is due to Dunwoody, who gives a bound for finitely presented groups on the number of edges given that every edge group is finite. Conversely there is no such bound for a general finitely generated group; again shown by Dunwoody. The purpose of this talk is to show that a similar bound exists for groups which act acylindrically on the corresponding Bass-Serre tree except on a class of subgroups with “bounded height”.

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

This talk is included in these lists:

• All CMS events
• CMS Events
• DPMMS info aggregator
• Geometric Group Theory (GGT) Seminar
• Hanchen DaDaDash
• Interested Talks
• Zoom: https://maths-cam-ac-uk.zoom.us/j/91636583222
• bld31

Note that ex-directory lists are not shown.