Solving the word problem with using formal languages

04/05/2011 - 12:15pm
04/05/2011 - 1:10pm
Rena Levitt (Claremont McKenna College)

In his 1911 paper, Max Dehn posed three seminal problems in combinatorial group theory: the word problem, the conjugacy problem, and the isomorphism problem. While each problem is undecidable in general (Novikov, 1955), algorithms have been developed for many well know classes of groups. In this talk I discuss using formal language theory to solve decision theoretic problems for groups, including the word and conjugacy problems, focusing on groups acting on spaces satisfying combinatorial curvature conditions.

Millikan 208 (Pomona College)

Claremont Graduate University | Claremont McKenna | Harvey Mudd | Pitzer | Pomona | Scripps
Proudly Serving Math Community at the Claremont Colleges Since 2007
Copyright © 2018 Claremont Center for the Mathematical Sciences