On automorphisms of Cayley-digraphs of abelian groups (Q1394822)

Suppose \(G\) is a finite additive abelian group, then fix some subset \(B\) of \(G\), such that for the identity element \(0\) of \(G\), \(0\not\in B\). The Cayley-digraph of \(G\) with respect to \(B\) is defined as the digraph \(\Gamma(G,B)\), which has vertex set \(G\) and for any pair of elements \(x,y\) of \(G\) there is an edge from \(x\) to \(y\), denoted by \(x\rightarrow y\), if and only if \(x-y\in B\). By \(\mathcal{A}(G,B)\) is denoted the full automorphism group of \(\Gamma(G,B)\). By the adjacency matrix of \(\Gamma(G,B)\) we mean a \(|G|\times |G|\) \((0,1)\)-matrix, whose rows and columns are indexed by the elements of \(G\), such that \(M(x,y)=1\) if and only if \(x\rightarrow y\) is in \(\Gamma(G,B)\). We mean by the eigenvalues of \(\Gamma(G,B)\), the eigenvalues of its adjacency matrix. In the case of arbitrary finite groups, the eigenvalues of Cayley-digraphs were determined in terms of the irreducible characters of the given group in \textit{L. Babai} [J. Comb. Theory, Ser. B 27, 180-189 (1979; Zbl 0338.05110)]. In the paper under review, the author derives equation relation automorphisms of \(\Gamma(G,b)\) and characters of \(G\) in the main lemma of the paper (Lemma 1) using Fourier transformation defined over \(G\). In Section 2, the following question is considered: if \(\mathcal{A}(G,B)\) is not regular, how many simple eigenvalues can \(\Gamma(G,B)\) have at most? The author denotes by \(N(G)\) the maximal number \(n\), such that a digraph \(\Gamma(G,B)\) exists having \(n\) simple eigenvalues, and \(\mathcal{A}(G,B)\not\cong G\). As an application of Lemma 1, it is proved in Theorem 3: If \(G\) is an abelian group of order \(n\), then \(N(G)\) is less than or equal to the largest proper divisor of \(n\). Also an example is given which shows that the bound \(N(G)\) in Theorem 3 holds with equality for \(G=C_p\times C_p\), where \(C_p\) is the cyclic group of order \(p\), \(p\) an odd prime. In Section 3, the author considers the case, when \(G=C_p\), \(p\) a prime. For any \(B\subset C_p\), the group \(\mathcal{A}(C_p,B)\) is a transitive permutation group of degree \(p\). It is doubly transitive only if the given digraph is complete. By a classical theorem of W. Burnside we know that every transitive group of prime degree is doubly transitive or isomorphic to a group of affine transformations \(x\mapsto ax+b\) over the field with \(p\) elements; see page 53 of \textit{J. L. Alperin} and \textit{R. B. Bell} [Groups and representations (Graduate Texts in Mathematics. 162. New York, NY: Springer-Verlag) (1995; Zbl 0839.20001)]. Without any reference to Burnside's theorem the author describes the group \(\mathcal{A}(C_p,B)\) by combining Lemma 1 with an argument involving finite geometries. Then using this he gives a short proof of Burnside's theorem.