A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Trimming and Gluing Gray Codes * †
unpublished
We consider the algorithmic problem of generating each subset of [n] := {1, 2,. .. , n} whose size is in some interval [k, l], 0 ≤ k ≤ l ≤ n, exactly once (cyclically) by repeatedly adding or removing a single element, or by exchanging a single element. For k = 0 and l = n this is the classical problem of generating all 2 n subsets of [n] by element additions/removals, and for k = l this is the classical problem of generating all n k subsets of [n] by element exchanges. We prove the existence
fatcat:5ybpysrdejbk3nr3il52mazofu