Bounding finite-image sequences of length ωk

Abstract

Given a well-quasi-order X and an ordinal α, the set sFα(X) of transfinite sequences on X with length less than α and with finite image is also a well-quasi-order, as proven by Nash-Williams. Before Nash-Williams proved it for general α, however, it was proven for α<ωω by Erdos and Rado. In this paper, we revisit Erdos and Rado's proof and improve upon it, using it to obtain upper bounds on the maximum linearization of sFωk(X) in terms of k and o(X), where o(X) denotes the maximum linearization of X. We show that, for fixed k, o(sFωk(X)) is bounded above by a function which can roughly be described as (k+1)-times exponential in o(X). We also show that, for k 2, this bound is not far from tight.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…