Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-26T00:39:49.031Z Has data issue: false hasContentIssue false

THE GENERATING GRAPH OF INFINITE ABELIAN GROUPS

Published online by Cambridge University Press:  29 January 2019

CRISTINA ACCIARRI
Affiliation:
Department of Mathematics, University of Brasilia, 70910-900 Brasília DF, Brazil email [email protected]
ANDREA LUCCHINI*
Affiliation:
Università degli Studi di Padova, Dipartimento di Matematica ‘Tullio Levi-Civita’, Via Trieste 63, 35121 Padova, Italy 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.

For a group $G$, let $\unicode[STIX]{x1D6E4}(G)$ denote the graph defined on the elements of $G$ in such a way that two distinct vertices are connected by an edge if and only if they generate $G$. Let $\unicode[STIX]{x1D6E4}^{\ast }(G)$ be the subgraph of $\unicode[STIX]{x1D6E4}(G)$ that is induced by all the vertices of $\unicode[STIX]{x1D6E4}(G)$ that are not isolated. We prove that if $G$ is a 2-generated noncyclic abelian group, then $\unicode[STIX]{x1D6E4}^{\ast }(G)$ is connected. Moreover, $\text{diam}(\unicode[STIX]{x1D6E4}^{\ast }(G))=2$ if the torsion subgroup of $G$ is nontrivial and $\text{diam}(\unicode[STIX]{x1D6E4}^{\ast }(G))=\infty$ otherwise. If $F$ is the free group of rank 2, then $\unicode[STIX]{x1D6E4}^{\ast }(F)$ is connected and we deduce from $\text{diam}(\unicode[STIX]{x1D6E4}^{\ast }(\mathbb{Z}\times \mathbb{Z}))=\infty$ that $\text{diam}(\unicode[STIX]{x1D6E4}^{\ast }(F))=\infty$.

Type
Research Article
Copyright
© 2019 Australian Mathematical Publishing Association Inc. 

Footnotes

Research partially supported by MIUR-Italy via PRIN ‘Group theory and applications’. The first author is also supported by Conselho Nacional de Desenvolvimento Científico e Tecnológico CNPq-Brazil and FAPDF.

References

Carter, D. and Keller, G., ‘Elementary expressions for unimodular matrices’, Comm. Algebra 12(3–4) (1984), 379389.Google Scholar
Crestani, E. and Lucchini, A., ‘The generating graph of finite soluble groups’, Israel J. Math. 198(1) (2013), 6374.Google Scholar
Lazard, D., ‘Le meilleur algorithme d’Euclide pour K[X] et ℤ’, C. R. Acad. Sci. Paris Sér. A–B 284(1) (1977), A1A4.Google Scholar
Lucchini, A., ‘The diameter of the generating graph of a finite soluble group’, J. Algebra 492 (2017), 2843.Google Scholar
Magnus, W., Karrass, A. and Solitar, D., Combinatorial Group Theory, reprint of the 1976 second edition (Dover, Mineola, NY, 2004).Google Scholar
O’Meara, O. T., ‘On the finite generation of linear groups over Hasse domains’, J. reine angew. Math. 217 (1965), 79108.Google Scholar