Random van Kampen diagrams and algorithmic problems in groups

Alexander Ushakov

City College, CUNY

May 12,
refreshments at 3:45pm


In this talk we are going to discuss the structure of random van Kampen diagrams over finitely presented groups. Such diagrams have many remarkable properties which allow one to design new fast algorithms for the word, membership, and conjugacy problems in groups.

This is joint work with Alexei Myasnikov.

Speaker's Contact Info: aushakov(at-sign)mail.ru

Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)math.mit.edu

Page loaded on May 10, 2004 at 01:27 PM. Copyright © 1998-99, Sara C. Billey. All rights reserved.