zbMATH — the first resource for mathematics

Elementary proof that \(\mathbb{Z}_p^4\) is a DCI-group. (English) Zbl 1310.05116
Summary: A finite group \(R\) is a \(\mathrm{DCI}\)-group if, whenever \(S\) and \(T\) are subsets of \(R\) with the Cayley graphs \(\mathrm{Cay}(R, S)\) and \(\mathrm{Cay}(R, T)\) isomorphic, there exists an automorphism \(\varphi\) of \(R\) with \(S^\varphi = T\).
Elementary abelian groups of order \(p^4\) or smaller are known to be \(\mathrm{DCI}\)-groups, while those of sufficiently large rank are known not to be \(\mathrm{DCI}\)-groups. The only published proof that elementary abelian groups of order \(p^4\) are \(\mathrm{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 \(\mathrm{DCI}\)-groups.

05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
Full Text: DOI arXiv
[1] Alspach, B.; Nowitz, L. A., Elementary proofs that \(\mathbb{Z}_p^2\) and \(\mathbb{Z}_p^3\) are CI-groups, European J. Combin., 20, 607-617, (1999) · Zbl 0942.05031
[2] Babai, L., Isomorphism problem for a class of point-symmetric structures, Acta Math. Acad. Sci. Hungar., 29, 329-336, (1977) · Zbl 0378.05035
[3] Babai, L.; Frankl, P., Isomorphisms of Cayley graphs I, Colloq. Math. Soc. J. Bolyai, 18, 35-52, (1976-1978) · Zbl 0404.05029
[4] Babai, L.; Frankl, P., Isomorphisms of Cayley graphs II, Acta Math. Acad. Sci. Hungar., 34, 177-183, (1979) · Zbl 0449.05029
[5] Dobson, E., Isomorphism problem for Cayley graphs of \(\mathbb{Z}_p^3\), Discrete Math., 147, 87-94, (1995) · Zbl 0838.05081
[6] E. Dobson, J. Morris, P. Spiga, Further restrictions on the structure of finite DCI-groups: an addendum, J. Algebraic Combin., in press. · Zbl 1328.05083
[7] Godsil, C. D., On Cayley graph isomorphisms, Ars Combin., 15, 231-246, (1983) · Zbl 0519.05036
[8] Hirasaka, M.; Muzychuk, M., An elementary abelian group of rank 4 is a CI-group, J. Combin. Theory Ser. A, 94, 339-362, (2001) · Zbl 1002.20030
[9] Li, C. H., On isomorphisms of finite Cayley graphs—a survey, Discrete Math., 256, 301-334, (2002) · Zbl 1018.05044
[10] Li, C. H.; Lu, Z. P.; Plfy, P. P., Further restrictions on the structure of finite CI-groups, J. Algebraic Combin., 26, 161-181, (2007) · Zbl 1124.05045
[11] Morris, J. M., Isomorphisms of Cayley graphs, (1999), Simon Fraser University, (Ph.D. thesis)
[12] Morris, J., Results towards showing \(\mathbb{Z}_p^n\) is a CI-group, Congr. Numer., 156, 143-153, (2002) · Zbl 1027.05047
[13] Muzychuk, M., An elementary abelian group of large rank is not a CI-group, Discrete Math., 264, 167-185, (2003) · Zbl 1027.05046
[14] Nowitz, L. A., A non-Cayley-invariant Cayley graph of the elementary abelian group of order 64, Discrete Math., 110, 223-228, (1992) · Zbl 0771.05048
[15] Royle, G. F., A normal non-Cayley-invariant graph for the elementary abelian group of order 64, J. Aust. Math. Soc., 85, 347-351, (2008) · Zbl 1167.05035
[16] Somlai, G., Elementary abelian \(p\)-groups of rank \(2 p + 3\) are not CI-groups, J. Algebraic. Combin., 34, 323-335, (2011) · Zbl 1294.20069
[17] Spiga, P., Elementary abelian \(p\)-groups of rank greater than or equal to \(4 p - 2\) are not CI-groups, J. Algebraic. Combin., 26, 343-355, (2007) · Zbl 1129.05018
[18] Spiga, P., CI-property of elementary abelian 3-groups, Discrete Math., 309, 33933398, (2009)
[19] Turner, J., Point-symmetric graphs with a prime number of points, J. Combin. Theory, 3, 136-145, (1967) · Zbl 0161.20803
[20] Wielandt, H., (Permutation Groups Through Invariant Relations and Invariant Functions, Lecture Notes, (1969), Ohio State University)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.