The Left-Regular Stabilizer of Zaks' Hamiltonian Cycle in the Pancake Graph
Abstract
Let Pn=Cay(Sn,\r2,…,rn\) 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 Zn in Pn. We determine the stabilizer of this particular cycle under the left regular action of Sn. If ρ=rn-1rn=[n,1,2,…,n-1], then, for every n3, StabL(Sn)(Zn)= Lρ,Lrn Dn, where Dn denotes the dihedral group of order 2n. The inclusion ⊃eq follows from the recursive block decomposition Wn=(Wn-1rn)n-1Wn-1 and from the palindromy WnR=Wn. The reverse inclusion follows from a general cyclic-order rigidity lemma: if a Hamiltonian cycle on a finite group is invariant under La, with ord(a)3, then every left translation preserving the same cycle conjugates a to a or a-1. For n5, Deng-Zhang's automorphism theorem gives the same stabilizer inside Aut(Pn); the exceptional ranks are handled separately. We also compute the compression factor of Zn: it is n for n4 and 6 for n=3.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.