3 citations · 6 across the 5 of their papers we have counts for
7 papers
Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
J. Sawada, J. Sears, A. Trautrim +1
Classic cycle-joining techniques have found widespread application in creating universal cycles for a diverse range of combinatorial objects, such as shorthand permutations, weak o…
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order
Joe Sawada, Aaron Williams, Dennis Wong
A flip-swap language is a set S of binary strings of length n such that is closed under two operations (when applicable): (1) Flip the leftmost 1; and (2) Swap the lef…
A Hamilton Cycle in the -Sided Pancake Network
Ben Cameron, Joe Sawada, Aaron Williams
We present a Hamilton cycle in the -sided pancake network and four combinatorial algorithms to traverse the cycle. The network's vertices are coloured permutations $π= p_1p_2\cd…
Combinatorial generation via permutation languages. I. Fundamentals
Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze +1
In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as perm…
Single-Player and Two-Player Buttons & Scissors Games
Kyle Burke, Erik D. Demaine, Harrison Gregg +12
We study the computational complexity of the Buttons \& Scissors game and obtain sharp thresholds with respect to several parameters. Specifically we show that the game is NP-compl…
Hamiltonicity of the Cayley Digraph on the Symmetric Group Generated by σ = (1 2 ... n) and τ = (1 2)
Aaron Williams
The symmetric group is generated by σ = (1 2 ... n) and τ = (1 2). We answer an open problem of Nijenhuis and Wilf by constructing a Hamilton path in the directed Cayley graph for…