{"title":"On the Width of the Cartesian Product of Ordinals","authors":"","doi":"10.1007/s11083-024-09668-8","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>The ordinal invariants, i.e., maximal order type, height, and width, are measures of a well quasi-ordering (wqo) based on the ordinal rank of the trees of its bad sequences, strictly decreasing sequences, and antichain sequences, respectively. Complex wqos are often built from simpler wqos through basic constructions such as disjoint sum, direct sum, cartesian product, and higher-order constructions like powerset or sequences. One main challenge is to compute the ordinal invariants of such wqos compositionally. This article focuses on the width of the cartesian product of wqos, for which no general formula is known. The particular case of the cartesian product of two ordinals has already been solved by Abraham in 1987, using the methods of residuals. We introduce a new method to get lower bounds on width, and apply it to the width of the cartesian product of finitely many ordinals, thus generalizing Abraham’s result. Finally, we leverage this result to compute the width of a generic family of elementary wqos that is closed under cartesian product.</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Order","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11083-024-09668-8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The ordinal invariants, i.e., maximal order type, height, and width, are measures of a well quasi-ordering (wqo) based on the ordinal rank of the trees of its bad sequences, strictly decreasing sequences, and antichain sequences, respectively. Complex wqos are often built from simpler wqos through basic constructions such as disjoint sum, direct sum, cartesian product, and higher-order constructions like powerset or sequences. One main challenge is to compute the ordinal invariants of such wqos compositionally. This article focuses on the width of the cartesian product of wqos, for which no general formula is known. The particular case of the cartesian product of two ordinals has already been solved by Abraham in 1987, using the methods of residuals. We introduce a new method to get lower bounds on width, and apply it to the width of the cartesian product of finitely many ordinals, thus generalizing Abraham’s result. Finally, we leverage this result to compute the width of a generic family of elementary wqos that is closed under cartesian product.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
