SearcharxivSearch

arXiv · 1403.4557

Elementary proof that $\mathbb Z_p^4$ is a DCI-group

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^4$ 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^4$ 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Joy Morris. 2014-03-18. Elementary proof that $\mathbb Z_p^4$ is a DCI-group. https://arxiv.org/abs/1403.4557

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR