Counting and Enumeration on a Set

Abstract

The basic problem of combinatorial mathematics is that of recognizing and enumerating or at least counting objects of specified character, out of an enormous number of unspecified objects. Most often, this is accomplished, implicitly or explicitly, by attaching an algebraic tag or weight to each desired trait and summing the weights thereby obtained. The desired objects can then be identified at leisure.