Jump to content

Combinatorial enumeration

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Oleg Alexandrov (talk | contribs) at 22:53, 21 March 2005 (Put categories/language links at the bottom). 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.