English

The power graph of a torsion-free group

Group Theory 2019-05-31 v2 Combinatorics

Abstract

The \emph{power graph} P(G)P(G) of a group GG is the graph whose vertex set is GG, with xx and yy joined if one is a power of the other; the \emph{directed power graph} P(G)\vec{P}(G) has the same vertex set, with an arc from xx to yy if yy is a power of xx. It is known that, for finite groups, the power graph determines the directed power graph up to isomorphism. However, it is not true that any isomorphism between power graphs induces an isomorphism between directed power graphs. Moreover, for infinite groups the power graph may fail to determine the directed power graph. In this paper, we consider power graphs of torsion-free groups. Our main results are that, for torsion-free nilpotent groups of class at most 22, and for groups in which every non-identity element lies in a unique maximal cyclic subgroup, the power graph determines the directed power graph up to isomorphism. For specific groups such as Z\mathbb{Z} and Q\mathbb{Q}, we obtain more precise results. Any isomorphism P(Z)P(G)P(\mathbb{Z})\to P(G) preserves orientation, so induces an isomorphism between directed power graphs; in the case of Q\mathbb{Q}, the orientations are either all preserved or all reversed. We also obtain results about groups in which every element is contained in a unique maximal cyclic subgroup (this class includes the free and free abelian groups), and about subgroups of the additive group of Q\mathbb{Q} and about Qn\mathbb{Q}^n.

Keywords

Cite

@article{arxiv.1705.01586,
  title  = {The power graph of a torsion-free group},
  author = {Peter J. Cameron and Horacio Guerra and Šimon Jurina},
  journal= {arXiv preprint arXiv:1705.01586},
  year   = {2019}
}