Elementary proof that \mathbb Z_p⁴ is a DCI-group

2014/03/18 by Joy Morris, Morris, Joy
Mathematics · Engineering · Computer Science · #Finite Group Theory Research #graph theory and CDMA systems #Coding theory and cryptography

paper · pdf · doi:10.48550/arxiv.1403.4557

Abstract

A finite group R is a DCI-group if, whenever S and T are subsets of R with the Cayley graphs \rm Cay(R,S) and \rm Cay(R,T) isomorphic, there exists an automorphism φ of R with S^φ=T. Elementary abelian groups of order p⁴ or smaller are known to be DCI-groups, while those of sufficiently large rank are known not to be DCI-groups. The only published proof that elementary abelian groups of order p⁴ are DCI-groups uses Schur rings and does not work for p=2 (which has been separately proven using computers). This paper provides a simpler proof that works for all primes. Some of the results in this paper also apply to elementary abelian groups of higher rank, so may be useful for completing our determination of which elementary abelian groups are DCI-groups.

Related

• Elementary abelian groups of rank 5 are DCI-groups
• Dihedral groups of order 2pq or 2pqr are DCI
• A comment on: "Further restrictions on the structure of finite DCI-groups"
• The Cayley isomorphism property for groups of order 8p
• Dihedral groups of square-free order are DCI-groups