We formulate an algorithm for calculating a representation by unipotent matrices over the integers of a finitely-generated torsion-free nilpotent group given by a polycyclic presentation. The algorithm works along a polycyclic series of the group, each step extending a representation of an element o
Digraphical Regular Representations of Infinite Finitely Generated Groups
✍ Scribed by R.G. Möller; N. Seifter
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 104 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
✦ Synopsis
A directed Cayley graph X is called a digraphical regular representation (DRR) of a group G if the automorphism group of X acts regularly on X . Let S be a finite generating set of the infinite cyclic group Z. We show that a directed Cayley graph X (Z, S) is a DRR of Z if and only if
As a general result we prove that a Cayley graph X of a finitely generated torsion-free nilpotent group N is a DRR if and only if no non-trivial automorphism of N of finite order leaves the generating set invariant.
📜 SIMILAR VOLUMES
A Cayley graph = Cay(G, S) is called a graphical regular representation of the group G if Aut = G. One long-standing open problem about Cayley graphs is to determine which Cayley graphs are graphical regular representations of the corresponding groups. A simple necessary condition for to be a graphi
## Abstract It was shown by Babai and Imrich [2] that every finite group of odd order except $Z^2\_3$ and $Z^3\_3$ admits a regular representation as the automorphism group of a tournament. Here, we show that for __k__ ≥ 3, every finite group whose order is relatively prime to and strictly larger t
An infinite circulant digraph is a Cayley digraph of the cyclic group of Z of integers . Here we prove that the full automorphism group of any strongly connected infinite circulant digraph over minimal generating set is just the group of translations of Z . We also present some related conjectures .