|
Organizers |
Algorithmic complexity of orders of groups
by
Jennifer Chubb
University of San Francisco
Coauthors: Mieczyslaw Dabkowski and Valentina Harizanov
A group is called computable if membership in the structure (as a set) can be effectively determined and there is an effective algorithm for computing the group operation. An ordering of the elements of a group is called a bi-ordering if it is invariant under the left and right actions of the group on itself. We consider the algorithmic complexity of bi-orderings admitted by a large class of residually nilpotent groups that includes surface groups. This work is joint with Valentina Harizanov and Mietek Dabkowski.
Date received: January 3, 2015
Copyright © 2015 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cbjz-84.