A combinatorial Gray code for a class of objects is a listing that contains each object from the
class exactly once such that any two consecutive objects in the list differ only by asmall …

We present a practical and elegant method for generating all (s, t)-combinations (binary
strings with s zeros and t ones): Identify the shortest prefix ending in 010 or 011 (or the entire …

This paper answers the following mathematical question: Can multiset permutations be
ordered so that each permutation is a prefix shift of the previous permutation? Previously …

A bubble language is a set of binary strings with a simple closure property: The first 01 of
any string can be replaced by 10 to obtain another string in the set. Natural representations …

We give a Gray code and constant average time generating algorithm for derangements, ie,
permutations with no fixed points. In our Gray code, each derangement is transformed into …

P. Chase and F. Ruskey each published a Gray code for length n binary strings with m
occurrences of 1, coding m-combinations of n objects, which is two-close—that is, in passing …

This paper presents a loopless algorithm to generate all permutations of a multiset. Each is
obtained from its predecessor by making one transposition. It differs from previous such …

The past decade has seen a flurry of research into pattern avoiding permutations but little of
it is concerned with their exhaustive generation. Many applications call for exhaustive …

Combinatorial objects can be represented by strings, such as 21534 for the permutation (1
2)(3 5 4), or 110100 for the binary tree corresponding to the balanced parentheses (()()) …

We give the first Gray code for the set of n-length permutations with a given number of
cycles. In this code, each permutation is transformed into its successor by a product with a …