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
Combinatorial Classification of Finitely Generated Virtually Free Groups
✍ Scribed by Thomas Müller
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 203 KB
- Volume
- 195
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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 r
In this short note the neighbourhood graph of a Cayley graph is considered. It has, as nodes, a symmetric generating set of a finitely-generated group . Two nodes are connected by an edge if one is obtained from the other by multiplication on the right by one of the generators. Two necessary conditi
We prove that the analog of the Grushko-Neumann theorem does not hold for profinite free products of profinite groups. To do that we bound the number of generators of a finite group generated by a family of subgroups of pairwise coprime orders.
A sufficient condition is obtained for the residual torsion-free nilpotence of certain finitely presented metabelian groups that arise from a matrix representa-Ž . tion developed by Magnus 1939, Ann. of Math. 40, 764᎐768 for metabelian Ž groups. Using this condition and a construction due to Baumsla