arXiv (OAI Expanded)
open access
Genlex Gray codes for $S_n$ with the fewest operations: classification and symmetry
A Gray code for $S_n$ is \emph{genlex} when words sharing a suffix are consecutive. We determine the genlex Gray codes for $S_n$ that use the fewest possible operations: Zaks' recursion generalises to a superfactorial family of such codes, and no code outside this family attains the minimum. Every c
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On neighbor distances and symmetry in group codes#490081
- Rank and classification of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard codes#973837
- The kernel-block rank profile and a complete classification of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-linear Hadamard codes#996775
- Monotone Erasure Codes#216781
- Involutions avoiding 4321 and another pattern of length four#1145119
Record · ID 1071021
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive