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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Recognisably context-free subsets of groups

Download to your calendar using vCal

  • UserAlex Levine, Manchester Speaker website
  • 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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lecture Theatre 6, Department of Engineering English Faculty, GR05 Castlereagh Room, Fisher Building, St. John's College

Other talks

Spectral rigidity of random covers of compact hyperbolic surfaces Morning Break Bigger Picture Talk: Developing future marine engines running on ammonia and other green fuels LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater Title to be confirmed Quantifying the unquantifiable? Assessing the importance of almsgiving in early modern France and Spain
 

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