Automorphisms of graph groups.

*(English)*Zbl 0682.20022Given a graph \(\Gamma=(V,E)\), the graph group \(F\langle\Gamma\rangle\) is the group with presentation \(\langle V\mid [E]\rangle\), where \([E]\) denotes the set of commutators \(\{[a,b]\mid\{a,b\}\in E\}\). The graph group \(F\langle\Gamma\rangle\) is modeled to be a group analog of the graph algebra K(\(\Gamma)\) generated as a free associative algebra on \(V\) modulo the ideal generated by commutators \([a,b]=ab-ba\) for \(\{a,b\}\in E\). Graph algebras were first studied by Kim, Makar-Limanov, Neggers and Roush. In this paper the author studies analogs in \(F\langle\Gamma\rangle\) of the Nielsen automorphisms of free groups, which reduce to Nielsen automorphisms in the case \(\Gamma=(V,\emptyset)\). The Centralizer Theorem describes the centralizer of elements \(u\) of \(F\langle\Gamma\rangle\). It follows from this description that the centralizer of a graph group is itself a graph group, which is a very nice result even if expected. A strong conjecture of this paper is that the elementary automorphisms (i.e., the analogs of the Nielsen automorphisms) generate the group of automorphisms of \(F\langle\Gamma\rangle\). The special cases proven are \(\Gamma=T\) a tree and \(\Gamma\) is star two-connected containing no triangles or squares. In arriving at these proofs the author develops a generalization of a theorem due to Humphreys on generating sets of free groups. Several additional useful lemmas and propositions provide further computational insights and demonstrate that a theory of graph groups, just as a theory of graph algebras, has a bright present as well as a bright future.

Reviewer: J.Neggers (Tuscaloosa)

##### MSC:

20F05 | Generators, relations, and presentations of groups |

20E36 | Automorphisms of infinite groups |

05C25 | Graphs and abstract algebra (groups, rings, fields, etc.) |

20F28 | Automorphism groups of groups |

##### Keywords:

presentations; commutators; Nielsen automorphisms; Centralizer Theorem; centralizers of graph groups; elementary automorphisms; groups of automorphisms; generating sets
Full Text:
DOI

##### References:

[1] | Dicks, W, An exact sequence for rings of polynomials in partly commuting indeterminants, J. pure appl. algebra, 22, 215-228, (1981) · Zbl 0471.16001 |

[2] | Droms, C.G.A, Graph groups, () |

[3] | Droms, C.G.A, Isomorphisms of graph groups, (1986), preprint |

[4] | Humphries, S.P, On weakly distinguished bases and free generating sets of free groups, Quart. J. math. Oxford ser., 36, 215-219, (1985), (2) · Zbl 0563.20026 |

[5] | Kim, K; Makar-Limanov, L; Neggers, J; Roush, F, Graph algebras, J. algebra, 64, No. 1, 46-55, (1980) · Zbl 0431.05023 |

[6] | Kim, K; Roush, F, Homology of certain algebrais defined by graphs, J. pure appl. algebra, 17, 179-186, (1980) · Zbl 0444.05066 |

[7] | Lyndon, R.C; Schupp, P.E, Combinatorial group theory, (1977), Springer-Verlag New York · Zbl 0368.20023 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.