A computer application to finite p-groups

DOI10.1017/S1446788700015962zbMath0277.20024OpenAlexW2106138043MaRDI QIDQ4402127

I. D. Macdonald

Publication date: 1974

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1446788700015962

Mathematics Subject Classification ID

Finite nilpotent groups, (p)-groups (20D15) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items

Groups with exponent six, Towards a soluble quotient algorithm, Some remarks on the computation of complements and normalizers in soluble groups, History and basic features of the critical-pair/completion procedure, Testing reducibility of linear differential operators: A group theoretic perspective, Some p-groups of Frobenius and extra-special type, Universal covers of finite groups, Matrix-product codes over finite chain rings, ON FINITE METACYCLIC p-GROUPS, Computing stable epimorphisms onto finite groups, Representing Subgroups of Finitely Presented Groups by Quotient Subgroups, Use of computers in solving well-known algebra problems, The breadth of finite p-groups, I, New negative Latin square type partial difference sets in nonelementary Abelian 2-groups and 3-groups, Schur Multipliers of Some Finite Nilpotent Groups

Cites Work

• Unnamed Item
• On the nilpotency class of a group of exponent four
• On a Class of Finitely Presented Groups
• A Machine Program for Coset Enumeration
• Varieties of groups