- Mex (mathematics)
-
In combinatorial game theory, the mex, or "minimum excludant", of a set of ordinals denotes the smallest ordinal not contained in the set.
Some examples:
where ω is the limit ordinal for the natural numbers.
In the Sprague-Grundy theory the minimum excluded ordinal plays a dominant role in determining the Nimbers of combinatorial games.
References
- Conway, John H. (2001). On Numbers and Games (2nd ed.). A.K. Peters. p. 124. ISBN 1-56881-127-6.
Categories:- Combinatorial game theory
- Mathematics stubs
Wikimedia Foundation. 2010.