Let be the pancake graph, with prefix reversals acting on the right. Conjugating Zaks’ suffix-reversal permutation Gray code by the full reversal gives a distinguished Hamiltonian cycle in . We determine the stabilizer of this particular cycle under the left regular action of . If , then, for every , , where denotes the dihedral group of order . The inclusion follows from the recursive block decomposition and from the palindromy . The reverse inclusion follows from a general cyclic-order rigidity lemma: if a Hamiltonian cycle on a finite group is invariant under , with , then every left translation preserving the same cycle conjugates to or . For , Deng-Zhang’s automorphism theorem gives the same stabilizer inside ; the exceptional ranks are handled separately. We also compute the compression factor of : it is for and for .

生成讲解博客的中文版本

生成AI智能校验的中文版本