1 citations · 1 across the 2 of their papers we have counts for
4 papers
Exhaustive Generation of Pattern-Avoiding s-Words
Samuel Buick, Madeleine Goertz, Amos Lastmann +6
The most well-known Gray code of permutations is plain changes. It was discovered in the 1600s by bell-ringers who wished to order the permutations of [n] by swaps (e.g., 123, 132,…
The Quaternary Gray Code and How It Can Be Used to Solve Ziggurat and Other Ziggu Puzzles
Madeleine Goertz, Aaron Williams
We investigate solutions to the new "Ziggu" family of exponential puzzles. These puzzles have pieces that form mazes. We encode the puzzle state as an quaternary number (ba…
On the Hardness of Gray Code Problems for Combinatorial Objects
Arturo Merino, Namrata, Aaron Williams
Can a list of binary strings be ordered so that consecutive strings differ in a single bit? Can a list of permutations be ordered so that consecutive permutations differ by a swap?…
Generating Signed Permutations by Twisting Two-Sided Ribbons
Yuan, Qiu, Aaron Williams
We provide a simple and natural solution to the problem of generating all signed permutations of . Our solution provides a pleasing generaliz…