University of Cambridge > > Geometric Group Theory (GGT) Seminar > Recognisably context-free subsets of groups

Recognisably context-free subsets of groups

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

  • UserAlex Levine, Manchester World_link
  • ClockFriday 19 January 2024, 13:45-14:45
  • HouseMR13.

If you have a question about this talk, please contact Francesco Fournier-Facio.

A subset E of a finitely generated group is called recognisably context-free if the set of all words over a finite generating set that represent elements in E forms a context-free language. This property does not depend on the choice of generating set. A theorem of Muller and Schupp fully classifies when the set {1} can be recognisably context-free, and significant efforts have been devoted to showing that in various classes of groups, the complement of {1} is recognisably context-free. We present some recent results in this area studying when finite sets, conjugacy classes and cosets can be recognisably context-free.

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-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity