Classification of distance-transitive orbital graphs of overgroups of the Jevons group (Q2295971): Difference between revisions

The Jevons group \(A\tilde{S}_n\) is an isometry group of the Hamming metric on the \(n\)-dimensional vector space \(V_n\) over \(\mathrm{GF}(2)\). It is generated by the group of all permutation \((n\times n)\)-matrices over \(\mathrm{GF}(2)\) and the translation group on \(V_n\). This article classify the distance-transitive orbital graphs of overgroups of the Jevons group. The authors proved that among the distance-transitive orbital graphs of overgroups of the Jevons group there are graphs which are isomorphic to the following ones: (1) the Hamming graph, (2) the complete graph \(K_{2^n}\), (3) the complete bipartite graph \(K_{2^{n-1},2^{n-1}}\), (4) the halved \((n+1)\)-cube, (5) the folded \((n+1)\)-cube, (6) the folded halved \((n+2)\)-cube, (7) the graphs of alternating forms, (8) the Taylor graph (for graphs of diameter \(3\)), (9) the complement of the \(2\times 2^{n-1}\)-lattice (for graphs of diameter \(3\)), (10) the complement of the graph \(2^{n-1}K_2\) consisting of \(2^{n-1}\) two-vertex connected components, (11) the Hadamard graph of order \(2^{n-2}\)(for graphs of diameter \(4\)), (12) the incidence graphs of the \(2-(2^{n-1},u_j^{(n)},2u_{j-1}^{(n-2)})\) square design (for graphs of diameter \(3\) for odd \(n\geq 5\)), \(j\in \{1,3\}\), where \[ u_i^{(n)}=\sum_{k=0}^{\lfloor(n-i)/4\rfloor}\binom{n}{4k+i},i=0,1,2,3 \]