✦ LIBER ✦

Isomorphism testing for p-groups

✍ Scribed by E.A. O'Brien

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 478 KB
Volume: 16
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1993.1049

No coin nor oath required. For personal study only.

✦ Synopsis

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 the p-group is also constructed.

📜 SIMILAR VOLUMES

Isomorphism testing for p-groups

✍ E.A. O'Brien 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 451 KB

On the isomorphism problem for just-infi

On the isomorphism problem for just-infinite groups

✍ Robert C. Brigham 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 414 KB

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.

P3-isomorphisms for graphs

✍ Aldred, R. E. L.; Ellingham, M. N.; Hemminger, R. L.; Jipsen, P. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

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

The Isomorphism and Isogeny Theorems for

The Isomorphism and Isogeny Theorems for Reductive Algebraic Groups

✍ Robert Steinberg 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Testing Matrix Groups for Primitivity

✍ Derek F. Holt; C.R. Leedham-Green; E.A. O'Brien; Sarah Rees 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 206 KB

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.

Isomorphic Group (and Loop) Algebras

✍ G. Leal; C.P. Milies 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 456 KB