Jump to content

Combinatorial enumeration

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Silverfish (talk | contribs) at 17:20, 18 September 2005 (Stub-sorting. You can help!). 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 that have symmetries which are combinatorial in nature. See combinatorics.