Jump to content

Combinatorial enumeration

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Masterflex (talk | contribs) at 05:45, 2 February 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Combinatorial enumeration is a subfield of enumeration that deals with the counting of objects whose symmetries do not exist or, if they exist, are combinatorial in nature. See combinatorics, superpattern