A computer application to finite p-groups

DOI10.1017/S1446788700015962MaRDI QIDQ4402127zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• A Machine Program for Coset Enumeration
• scientific article; zbMATH DE number 3137403 (Why is no real title available?)
• On a Class of Finitely Presented Groups
• On the nilpotency class of a group of exponent four
• Varieties of groups

Cited in

(17)

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

This page was built for publication: A computer application to finite p-groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4402127)