A Gray code for the shelling types of the boundary of a hypercube (Q1928446): Difference between revisions

Recently, \textit{A. King} [ibid. 306, No. 5, 508--518 (2006; Zbl 1086.05004)] provided a transposition Gray code for the set of all indecomposable permutations of length \(n\). In this article, the authors construct an adjacent transposition Gray code for a signed variant of the indecomposable permutations, called sign-connected permutations of the set \(\{\pm1,\pm 2,\dots,\pm n\}\). These permutations encode the shelling types of the boundary of the hypercube. The author proves that this Gray code can be generated in constant amortized time.