University of Cambridge > Talks.cam > Geometric Group Theory (GGT) Seminar > Accessibility of partially acylindrical actions

Accessibility of partially acylindrical actions

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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