Search arXivSearch

arXiv · 2607.04658

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

Abstract

Let $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 $Z_n$ in $P_n$. We determine the stabilizer of this particular cycle under the left regular action of $S_n$. If $ρ=r_{n-1}r_n=[n,1,2,\ldots,n-1]$, then, for every $n\ge3$, $\mathrm{Stab}_{L(S_n)}(Z_n)=\langle L_ρ,L_{r_n}\rangle\cong D_n$, where $D_n$ denotes the dihedral group of order $2n$. The inclusion $\supseteq$ follows from the recursive block decomposition $W_n=(W_{n-1}r_n)^{n-1}W_{n-1}$ and from the palindromy $W_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 $L_a$, with $\mathrm{ord}(a)\ge3$, then every left translation preserving the same cycle conjugates $a$ to $a$ or $a^{-1}$. For $n\ge5$, Deng-Zhang's automorphism theorem gives the same stabilizer inside $\mathrm{Aut}(P_n)$; the exceptional ranks are handled separately. We also compute the compression factor of $Z_n$: it is $n$ for $n\ge4$ and $6$ for $n=3$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Or-Hai Benjo, Yehonathan Sharvit. 2026-07-06. The Left-Regular Stabilizer of Zaks' Hamiltonian Cycle in the Pancake Graph. https://arxiv.org/abs/2607.04658

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO