English

The Left-Regular Stabilizer of Zaks' Hamiltonian Cycle in the Pancake Graph

Combinatorics 2026-07-06 v1

Abstract

Let Pn=Cay(Sn,{r2,,rn})P_n=\mathrm{Cay}(S_n,\{r_2,\ldots,r_n\}) 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 ZnZ_n in PnP_n. We determine the stabilizer of this particular cycle under the left regular action of SnS_n. If ρ=rn1rn=[n,1,2,,n1]\rho=r_{n-1}r_n=[n,1,2,\ldots,n-1], then, for every n3n\ge3, StabL(Sn)(Zn)=Lρ,LrnDn\mathrm{Stab}_{L(S_n)}(Z_n)=\langle L_\rho,L_{r_n}\rangle\cong D_n, where DnD_n denotes the dihedral group of order 2n2n. The inclusion \supseteq follows from the recursive block decomposition Wn=(Wn1rn)n1Wn1W_n=(W_{n-1}r_n)^{n-1}W_{n-1} and from the palindromy WnR=WnW_n^R=W_n. The reverse inclusion follows from a general cyclic-order rigidity lemma: if a Hamiltonian cycle on a finite group is invariant under LaL_a, with ord(a)3\mathrm{ord}(a)\ge3, then every left translation preserving the same cycle conjugates aa to aa or a1a^{-1}. For n5n\ge5, Deng-Zhang's automorphism theorem gives the same stabilizer inside Aut(Pn)\mathrm{Aut}(P_n); the exceptional ranks are handled separately. We also compute the compression factor of ZnZ_n: it is nn for n4n\ge4 and 66 for n=3n=3.

Keywords

Cite

@article{arxiv.2607.04658,
  title  = {The Left-Regular Stabilizer of Zaks' Hamiltonian Cycle in the Pancake Graph},
  author = {Or-Hai Benjo and Yehonathan Sharvit},
  journal= {arXiv preprint arXiv:2607.04658},
  year   = {2026}
}

Comments

13 pages