An **enumeration** of a collection of items is a complete, ordered listing of all of the items in that collection. The term is commonly used in mathematics and theoretical computer science to refer to a listing of all of the elements of a set. In statistics the term categorical variable is used rather than enumeration. The precise requirements for an enumeration (for example, whether the set must be finite, or whether the list is allowed to contain repetitions) depend on the branch of mathematics and the context in which one is working.

Some sets can be enumerated by means of a **natural ordering** (such as 1, 2, 3, 4, ... for the set of positive integers), but in other cases it may be necessary to impose a (perhaps arbitrary) ordering. In some contexts, such as enumerative combinatorics, the term *enumeration* is used more in the sense of *counting* – with emphasis on determination of the number of elements that a set contains, rather than the production of an explicit listing of those elements.

Read more about Enumeration: Enumeration in Combinatorics, Enumeration in Set Theory, Enumeration in Computability Theory

### Other articles related to "enumeration, enumerations":

... For

**enumeration**, Petrifilm plates can be used on any colony counter for

**enumeration**just like a Petri dish ... Various

**enumeration**experiments have shown very little or no variance between counts obtained through Petrifilm and standard agar counts ...

**Enumeration**

... the number of claw-free cubic graphs to be counted very efficiently, unusually for graph

**enumeration**problems ...

... micro-organisms and are meant to be a more efficient method for detection and

**enumeration**compared to conventional plating techniques ... a cold-water-soluble gelling agent, nutrients, and indicators for activity and

**enumeration**... grid is printed on the back of the plate to assist

**enumeration**...

**Enumeration**Problem

... In mathematics, the vertex

**enumeration**problem for a polytope, a polyhedral cell complex, a hyperplane arrangement, or some other object of discrete geometry, is the problem of determination of the ... A classical example is the problem of

**enumeration**of the vertices of a convex polytope specified by a set of linear inequalities where A is an m×n ...

**Enumeration**in Computability Theory

... In computability theory one often considers countable

**enumerations**with the added requirement that the mapping from to the enumerated set must be computable ... A specific example of a set with an

**enumeration**but not a computable

**enumeration**is the complement of the halting set ... There exists a computable

**enumeration**of the halting set, but not one that lists the elements in an increasing ordering ...