论文信息 - Algorithms and Geometry for Graph Products of Groups

Algorithms and Geometry for Graph Products of Groups

Recent work of Gromov, Epstein, Cannon, Thurston and many others has generated strong interest in the geometric and algorithmic structure of finitely generated infinite groups. (See [16],[17] and [14].) Many of these structures are preserved by taking graph products. The graph product of groups (not to be confused with the fundamental group of a graph of groups) is a product mixing direct and free products. Whether the product between two groups in the graph product is free or direct is determined by a simplicial graph. Given a simplicial graph we say that two vertices are adjacent if they are joined by a single edge.

Susan Hermiller | J. Meier | John Meier | S. Hermiller

[1] S. Hermiller. Rewriting systems for Coxeter groups , 1994 .

[2] GROUPS AND COMBINGS , 1990 .

[3] David B. A. Epstein,et al. Word processing in groups , 1992 .

[4] R. Howlett,et al. A finiteness property an an automatic structure for Coxeter groups , 1993 .

[5] Juan M. Alonso. Combings of Groups , 1992 .

[6] M. Newman. On Theories with a Combinatorial Definition of "Equivalence" , 1942 .

[7] Carl Droms,et al. Subgroups of Graph Groups , 1987 .

[8] Deepak Kapur,et al. An Overview of Rewrite Rule Laboratory (RRL) , 1989, RTA.

[9] Carl Droms,et al. Graph groups, coherence, and three-manifolds , 1987 .

[10] Herman Servatius,et al. Automorphisms of graph groups , 1989 .

[11] Ronald V. Book,et al. Rewriting Systems and Word Problems in a Free Partially Commutative Monoid , 1987, Inf. Process. Lett..

[12] Martin R. Bridson. On the geometry of normal forms in discrete groups , 1993 .

[13] Ruth Charney,et al. Artin groups of finite type are biautomatic , 1992 .

[14] Elisabeth Ruth Green,et al. Graph products of groups , 1990 .

[15] Gilbert Baumslag,et al. Automatic groups and amalgams , 1991 .

[16] Volker Diekert,et al. On the Knuth-Bendix Completion for Concurrent Processes , 1987, Theor. Comput. Sci..

[17] David Peifer. Artin groups of extra-large type are biautomatic , 1996 .

[18] Matthias Jantzen,et al. Confluent String Rewriting , 1988, EATCS Monographs on Theoretical Computer Science.