We describe the theoretical and practical details of an algorithm which can be used to decide whether two given presentations for finite \(p\)-groups present isomorphic groups. The approach adopted is to construct a canonical presentation for each group. A description of the automorphism group of th
Isomorphism testing for p-groups
โ Scribed by E.A. O'Brien
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 451 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The work for this paper was carried out partly at the Courant Institute of Mathematical Sciences under NSF Grant GP-12024. Reproduction in whole or in part is permitted for any purpose of the United States Government. Communicated through G. Baumslag.
The P 3 -graph of a finite simple graph G is the graph whose vertices are the 3-vertex paths of G, with adjacency between two such paths whenever their union is a 4-vertex path or a 3-cycle. In this paper we show that connected finite simple graphs G and H with isomorphic P 3 -graphs are either isom
We describe an algorithm which seeks to decide whether or not a matrix group defined over a finite field acts to preserve blocks of imprimitivity and, if so, to find a block system. Implementations of the algorithm are publicly available.