Atlas home || Conferences | Abstracts | about Atlas

G^3 = Geometric Group Theory on the Gulf Coast
November 8-10, 2002

Pensacola Beach, FL, USA

Organizers
Stephen Brick, Igor Mineyev, Mark Sapir, Guoliang Yu

View Abstracts
Conference Homepage

Infinite words and algorithmic problems for fully residually free groups
by
Alexei Miasnikov
McGill University and CCNY.

I will discuss how infinite words can be used in solving algorithmic problems for fully residually free groups. The key observation is that elements of fully residually free groups can be uniquely represented by reduced infinite words of a particular type. It turns out that the well-known arguments which are valid in free groups (Nielsen method, Stallings foldings, etc.) are still valid in fully residually free groups when finite words are replaced by infinite ones.

This talk is based on joint results with B.Khan, O.Kharlampovich, V.Remeslennikov, and D.Serbin.

Date received: October 7, 2002

Copyright © 2002 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cajt-07.