Generation of combinatorial objects

  • Alexander Shen
Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)


In this chapter, we deal with problems that require us to generate all the elements of some finite set one-by-one. We start with a simple example in section 2.1 (generating all sequences of fixed length composed of elements of some finite set). Then in section 2.2 we generate all permutations of a given set. It is more difficult since now the elements are not independent (no element should appear twice). Two other popular combinatorial objects are considered in sections 2.3 (subsets of fixed size) and 2.4 (partitions). Some applications (including Gray codes) are considered in section 2.5. In section 2.6 we consider some examples where elements to be generated are in one-to-one correspondence with elements of some other set (which are easier to generate). Finally, in section 2.7 we consider a classical problem where we have to count elements of some class (without generating them).


Lexicographic Order Alphabetic Order Gray Code Catalan Number Combinatorial Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Laboratoire d’Informatique Fondamentale de Marseille (LIF) CNRSUniversité de la Méditerranée, Université de ProvenceMarseille Cedex 13France
  2. 2.Russian Academy of SciencesInstitute for Information Transmission ProblemsMoscowRussia

Personalised recommendations