The group identification problem for p-groups of small order
classification
🧮 math.GR
keywords
groupsorderalgorithmdifficultgroupidentificationinvariantsproblem
read the original abstract
We investigate which invariants of groups are powerful in distinguishing non-isomorphic p-groups. Based on this, we devise an effective algorithm to solve the group identification problem for the $10,494,213$ groups of order $2^9$. We exhibit a list of groups of order $2^9$ which are difficult to distinguish y invariants and thus are the most difficult cases for our algorithm.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.