English

Bounding finite-image sequences of length $\omega^k$

Logic 2026-03-11 v2

Abstract

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

Keywords

Cite

@article{arxiv.2409.03199,
  title  = {Bounding finite-image sequences of length $\omega^k$},
  author = {Harry Altman},
  journal= {arXiv preprint arXiv:2409.03199},
  year   = {2026}
}

Comments

16 pages