This volume contains the proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Geometric Group Theory and Computer Science held at Mount Holyoke College (South Hadley, MA). The conference was devoted to computational aspects of geometric group theory, a relatively young area of research which has grown out of an influx of ideas from topology and computer science into combinatorial group theory. The book reflects recent progress in this interesting new field. Included are articles about insights from computer experiments, applications of formal language theory, decision problems, and complexity problems. There is also a survey of open questions in combinatorial group theory. The volume will interest group theorists, topologists, and experts in automata and language theory.
Open problems in combinatorial group theory by G. Baumslag, A. G. Myasnikov, and V. Shpilrain The bar problem-A simple tiling problem which is $NP$-complete on the Euclidean tessellation by squares but which is polynomial time on the hyperbolic tessellations by $4g$-gons, $g \geq 2$ by D. Beauquier, D. E. Muller, and P. E. Schupp When are centralizers of finite subgroups of $Out(F n)$ finite? by D. L. Boutin Computing angles in hyperbolic groups by Z. Grunschlag On effective decidability of the homeomorphism problem for non-compact surfaces by O. Ly Some presentations of the trivial group by C. F. Miller III and P. E. Schupp A language theoretic analysis of combings by S. Rees.