{"title":"限定长度为 $ω^k$ 的有限图像字符串","authors":"Harry Altman","doi":"arxiv-2409.03199","DOIUrl":null,"url":null,"abstract":"Given a well-quasi-order $X$ and an ordinal $\\alpha$, the set $s^F_\\alpha(X)$\nof transfinite strings on $X$ with length less than $\\alpha$ and with finite\nimage is also a well-quasi-order, as proven by Nash-Williams. Before\nNash-Williams proved it for general $\\alpha$, however, it was proven for\n$\\alpha<\\omega^\\omega$ by Erd\\H{o}s and Rado. In this paper, we revisit\nErd\\H{o}s and Rado's proof and improve upon it, using it to obtain upper bounds\non the maximum linearization of $s^F_{\\omega^k}(X)$ in terms of $k$ and $o(X)$,\nwhere $o(X)$ denotes the maximum linearization of $X$. We show that, for fixed\n$k$, $o(s^F_{\\omega^k}(X))$ is bounded above by a function which can roughly be\ndescribed as $(k+1)$-times exponential in $o(X)$. We also show that, for $k\\le\n2$, this bound is not far from tight.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bounding finite-image strings of length $ω^k$\",\"authors\":\"Harry Altman\",\"doi\":\"arxiv-2409.03199\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a well-quasi-order $X$ and an ordinal $\\\\alpha$, the set $s^F_\\\\alpha(X)$\\nof transfinite strings on $X$ with length less than $\\\\alpha$ and with finite\\nimage is also a well-quasi-order, as proven by Nash-Williams. Before\\nNash-Williams proved it for general $\\\\alpha$, however, it was proven for\\n$\\\\alpha<\\\\omega^\\\\omega$ by Erd\\\\H{o}s and Rado. In this paper, we revisit\\nErd\\\\H{o}s and Rado's proof and improve upon it, using it to obtain upper bounds\\non the maximum linearization of $s^F_{\\\\omega^k}(X)$ in terms of $k$ and $o(X)$,\\nwhere $o(X)$ denotes the maximum linearization of $X$. We show that, for fixed\\n$k$, $o(s^F_{\\\\omega^k}(X))$ is bounded above by a function which can roughly be\\ndescribed as $(k+1)$-times exponential in $o(X)$. We also show that, for $k\\\\le\\n2$, this bound is not far from tight.\",\"PeriodicalId\":501306,\"journal\":{\"name\":\"arXiv - MATH - Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.03199\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.03199","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Given a well-quasi-order $X$ and an ordinal $\alpha$, the set $s^F_\alpha(X)$
of transfinite strings on $X$ 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^F_{\omega^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(s^F_{\omega^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\le
2$, this bound is not far from tight.