Except in degree six, the -cycles are characterized among order-three elements by the largest centralizer. Their cyclic subgroups correspond to three-element supports. Two different such subgroups commute exactly for disjoint supports; with one common point their generator products have order five, and with two common points those products have order two or three. Thus an automorphism induces an automorphism of . The maximal cliques of a Johnson graph reconstruct a permutation of the points. After undoing that permutation, an automorphism fixes every cyclic -subgroup. Product orders force its choices of generator inversion to be consistent on the connected graph, and inversion of every -cycle would reverse a noncommuting product. Hence it fixes all -cycles, which generate .
Articles by others on the same topic
There are currently no matching articles.