@book{d51d3dc9d9144d3293ef4775c8fb80cd,
title = "Enumerating submultisets of multisets",
abstract = "In this paper we consider the problem of enumerating the submultisets of a multiset, in which each element has equal multiplicity. The crucial property is that consecutive submultisets in this listing differ one in the cardinality of only one of the elements. This is a generalization to k-ary numbers of the so-called Gray Codes for binary numbers. In the special case of binary numbers there is also a link to the Game Of Hanoi. We give an example where these results were put to good use, and indicate when in general the method described can be applied.",
keywords = "Wiskunde en Informatica (WIIN)",
author = "Jurriaan Hage",
year = "2001",
language = "English",
series = "Technical Report Series",
publisher = "Department of Information and Computing Sciences, Utrecht University",
number = "CS-2001/2001-27",
}