This site is supported by donations to The OEIS Foundation.
Subsequence preorder
Sequences are preordered by the subsequence relation. The unique bottom element is the empty sequence. The equivalence class of top elements are those sequences which contain all integers infinitely often, for example:
- A000503, A002321, A004718, A037448, A038760, A054848, A055017, A065359, A065363, A065364, A065368, A065675, A065676, A097150, A196199
(Sets are cofinal in this preorder precisely if they contain a top element.) See also Sequences that contain every finite sequence in the Index.
Consequently the relation is a directed preorder.
This preorder has infinite antichains such as {(0, 0, 0, ...), (1, 1, 1, ...), (2, 2, 2, ...), ...}, and hence is not well-quasi-ordered.
Cite this page as
Charles R Greathouse IV, Subsequence preorder. — From the On-Line Encyclopedia of Integer Sequences® (OEIS®) wiki. (Available at https://oeis.org/wiki/Subsequence_preorder)