Logspace computable groups
Time and place
4 PM on Friday, November 5th, 2010; GC 5417
Gillian Elston (Hofstra University)
Abstract
We consider groups with normal forms computable in logspace and show that having such a normal form is independent of the generating set. We define a group to be logspace computable if it embeds in a group with normal forms computable in logspace. The class of logspace computable groups includes free groups and finitely generated nilpotent groups. It is closed under direct and wreath products, finite extension and finite index subgroups.
