Cayley digraphs with normal adjacency matrices (Q1043955): Difference between revisions

Let \(G\) be a finite group and \(S\) a subset of \(G\) which does not contain the identity element. The Cayley digraph \(D(G,S)\) is the digraph with \(G\) as vertex set and \(\{(g, sg): g\in G,\;s\in S\}\) as arc-set. The digraph \(D(G,S)\) is regular of degree the cardinality of \(S\). The adjacency matrix of \(D(G,S)\), denoted \(A(G,S)\), is the matrix with rows and columns labeled by the elements of \(G\), and the entry \((g,h)\) is \(1\) if \((g,h)\) is an arc and \(0\) otherwise. A matrix with real entries is normal i it commutes with its transpose. In the first part of the paper, the authors give conditions on \(S\) for \(A(G,S)\) being normal. In the second part, they apply these conditions to proof the main theorem: If \(G\) is a finite group such that for all Cayley digraph \(D(G,S)\) of degree two the adjacency matrix \(A(G,S)\) is normal, then either \(G\) is abelian or \(G\) is isomorphic to \(Q_8\times{\mathbb Z}_2^n\), where \(Q_8\) stands for the quaternion group and \(n\geq 0\) is an integer. In the last part, the authors define two families \(T_{n,k}\) and \(H_{p,q}\) of pairwise non isomorphic groups. Then, they classify the finite groups \(G\) such that there exists a generating set \(S\) of cardinality two such that \(A(G,S)\) is normal. They show that, in this case, either \(G\) is an abelian group of rank two, or \(G\) is isomorphic to a group \(T_{n,k}\), or \(G\) is isomorphic to a group \(H_{p,q}\).