04/05/2011 - 12:15pm

04/05/2011 - 1:10pm

Speaker:

Rena Levitt (Claremont McKenna College)

Abstract:

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.

Where:

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