Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-26T03:11:40.889Z Has data issue: false hasContentIssue false

RIGIDITY OF GRAPH PRODUCTS OF ABELIAN GROUPS

Published online by Cambridge University Press:  01 April 2008

MAURICIO GUTIERREZ
Affiliation:
Department of Mathematics, Tufts University, 503 Boston Ave, Medford, MA 02155, USA (email: [email protected])
ADAM PIGGOTT
Affiliation:
Department of Mathematics, Tufts University, 503 Boston Ave, Medford, MA 02155, USA (email: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We show that if G is a group and G has a graph-product decomposition with finitely generated abelian vertex groups, then G has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex group is a directly indecomposable cyclic group, and a unique decomposition in which each vertex group is a finitely generated abelian group and the graph satisfies the T0 property. Our results build on results by Droms, Laurence and Radcliffe.

Type
Research Article
Copyright
Copyright © 2008 Australian Mathematical Society

References

[1]Droms, C., ‘Isomorphisms of graph groups’, Proc. Amer. Math. Soc. 100(3) (1987), 407408.CrossRefGoogle Scholar
[2]Green, E. R., ‘Graph products of groups’, PhD Thesis, The University of Leeds, 1990.Google Scholar
[3]Hillar, C. J. and Rhea, D. L., ‘Automorphisms of finite abelian groups’, Amer. Math. Monthly 114(10) (2007), 917923.CrossRefGoogle Scholar
[4]Laurence, M. R., ‘Automorphisms of graph products of groups’, PhD Thesis, Queen Mary College, University of London, 1993.Google Scholar
[5]Laurence, M. R., ‘A generating set for the automorphism group of a graph group’, J. London Math. Soc. (2) 52(2) (1995), 318334.CrossRefGoogle Scholar
[6]Radcliffe, D. G., ‘Rigidity of graph products of groups’, Algebr. Geom. Topol. 3 (2003), 10791088 (electronic).CrossRefGoogle Scholar