On ordinals

Revision en2, by OIer1048576, 2024-08-28 11:11:53

In mathematics, ordinals extend the concept of counting beyond finite numbers and incorporate infinite sequences. From a graph theory perspective, you can think of ordinals as a hierarchy of "layers" or "levels" that represent different sizes and types of infinity.

In this blog, we define ordinals as a (maybe infinite) competitive graph $$$\Gamma$$$ (A directed graph is a competitive graph, if exactly one of $$$(u, v)$$$ and $$$(v, u)$$$ is in the edge set) without any loops.

Finite ordinals are natural numbers. For example, $$$0$$$ is the empty graph, and $$$1$$$ is the only graph with one vertex. Further example is as below:

Tags ordinal, minimum excluded ordinal, mex, math, graph, game theory, sg function

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en12 English OIer1048576 2024-08-30 08:51:42 11
en11 English OIer1048576 2024-08-29 16:56:23 4095
en10 English OIer1048576 2024-08-28 17:15:17 0 (published)
en9 English OIer1048576 2024-08-28 17:14:52 30 (saved to drafts)
en8 English OIer1048576 2024-08-28 17:12:40 6 Tiny change: '[problem:1984D].' -> '[problem:1149E].'
en7 English OIer1048576 2024-08-28 17:11:38 2
en6 English OIer1048576 2024-08-28 17:10:16 3
en5 English OIer1048576 2024-08-28 17:09:02 2832 (published)
en4 English OIer1048576 2024-08-28 12:17:14 593
en3 English OIer1048576 2024-08-28 11:56:16 2095
en2 English OIer1048576 2024-08-28 11:11:53 4 Tiny change: 'ow:\n![](hhttps://ib' -> 'ow:\n![](https://ib'
en1 English OIer1048576 2024-08-28 11:11:32 673 Initial revision (saved to drafts)