2008
DOI: 10.1017/s0004972708000105
|View full text |Cite
|
Sign up to set email alerts
|

Rigidity of Graph Products of Abelian Groups

Abstract: 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 T 0 property. Our results build on results by Droms, Laurence and Radcliffe.2000 Mathematics subject classification:… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(12 citation statements)
references
References 5 publications
0
12
0
Order By: Relevance
“…Our purpose is to find a set of generators for Aut G using the properties of (Γ, o). The new feature in the present paper is, as in [9], the mixture of infinite and finite cyclic groups.…”
Section: Introductionmentioning
confidence: 91%
See 3 more Smart Citations
“…Our purpose is to find a set of generators for Aut G using the properties of (Γ, o). The new feature in the present paper is, as in [9], the mixture of infinite and finite cyclic groups.…”
Section: Introductionmentioning
confidence: 91%
“…As usual the support of a CR element u is S. Assume v ∈ S. If S lies in some complete subgraph, the result is found in [9,Lemma 2.2]. Assume then that S does not lie in a complete subgraph.…”
Section: Appendix a A Proof Of The Centralizer Theoremmentioning
confidence: 98%
See 2 more Smart Citations
“…The class of graph products of directly-indecomposable cyclic groups is identical to the class of graph products of finitely-generated abelian groups for the following reason: if G is group and G is isomorphic to a graph product of finitely-generated abelian groups, then there exists a unique isomorphism class of labeled-graphs (Γ, m) such that G ∼ = W (Γ, m) [12]. Empowered by this fact, we usually omit mention of Γ and m from the notation, writing W := W (Γ, m).…”
Section: Introductionmentioning
confidence: 99%