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.
Similar content being viewed by others
Availability of data and materials
Our manuscript contains no associated data.
Code Availability
Our manuscript contains no associated code.
References
Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3) 2(7), 326–336 (1952). https://doi.org/10.1112/plms/s3-2.1.326
de Jongh, D.H.J., Parikh, R.: Well-partial orderings and hierarchies. Indag. Math. 39(3), 195–207 (1977). https://doi.org/10.1016/1385-7258(77)90067-1
Milner, E.C.: Basic WQO- and BQO-theory. In: Rival, I. (ed.) Graphs and Order. NATO ASI Series C, vol. 147, pp. 487–502. Springer, Dordrecht (1985). https://doi.org/10.1007/978-94-009-5315-4_14
Schuster, P., Seisenberger, M., Weiermann, A. (eds.): Well Quasi-Orders in Computation, Logic, Language and Reasoning. Trends in Logic, vol. 53. Springer, Berlin/Heidelberg, Germany (2020). https://doi.org/10.1007/978-3-030-30229-0_2
Schmidt, D.: Well-partial orderings and their maximal order types. Habilitationsschrift, Heidelberg (1979)
Kříž, I., Thomas, R.: Ordinal types in Ramsey theory and well-partial-ordering theory. In: Nešetřil, J., Rödl, V. (eds.) Mathematics of Ramsey Theory. Algorithms and Combinatorics, vol. 5, pp. 57–95. Springer, Berlin/Heidelberg, Germany (1990). https://doi.org/10.1007/978-3-642-72905-8_7
Abraham, U., Bonnet, R.: Hausdorff’s theorem for posets that satisfy the finite antichain property. Fund. Math. 159(1), 51–69 (1999). https://doi.org/10.4064/fm-159-1-51-69
Blass, A., Gurevich, Y.: Program termination and well partial orderings. ACM Trans. Computational Logic 9(3), 1–26 (2008). https://doi.org/10.1145/1352582.1352586
Bonnet, R., Finkel, A., Haddad, S., Rosa-Velardo, F.: Ordinal theory for expressiveness of well-structured transition systems. Inf. Comput. 224, 1–22 (2013). https://doi.org/10.1016/j.ic.2012.11.003
Haase, Ch., Schmitz, S., Schnoebelen, Ph.: The power of priority channel systems. Logical Methods in Comp. Science 10(4:4) (2014). https://doi.org/10.2168/LMCS-10(4:4)2014
Haddad, S., Schmitz, S., Schnoebelen, Ph.: The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. In: Proc. 27th IEEE Symp. Logic in Computer Science (LICS 2012), Dubrovnik, Croatia, June 2012, pp. 355–364 (2012). https://doi.org/10.1109/LICS.2012.46
Schmitz, S.: The parametric complexity of lossy counter machines. In: Proc. 46th Int. Coll. Automata, Languages, and Programming (ICALP 2019), Patras, Greece, July 2019. Leibniz International Proceedings in Informatics, vol. 132, pp. 129–112915. Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2019). https://doi.org/10.4230/LIPIcs.ICALP.2019.129
Džamonja, M., Schmitz, S., Schnoebelen, Ph.: On ordinal invariants in well quasi orders and finite antichain orders. In: Schuster, P., Seisenberger, M., Weiermann, A. (eds.) Well Quasi-Orders in Computation, Logic, Language and Reasoning. Trends in Logic, vol. 53, pp. 29–54. Springer, Berlin/Heidelberg, Germany (2020). Chap. 2. https://doi.org/10.1007/978-3-030-30229-0_2
Abraham, U.: A note on Dilworth’s theorem in the infinite case. Order 4(2), 107–125 (1987). https://doi.org/10.1007/BF00337691
Wolk, E.S.: Partially well ordered sets and partial ordinals. Fund. Math. 60(2), 175–186 (1967). https://doi.org/10.4064/fm-60-2-175-186
Holz, M., Steffens, K., Weitz, E.: Introduction to Cardinal Arithmetic. Modern Birkhäuser Classics. Springer, Berlin/Heidelberg, Germany (1999). https://doi.org/10.1007/978-3-0346-0330-0
Manolios, P., Vroon, D.: Ordinal arithmetic: Algorithms and mechanization. J. Autom. Reason. 34(4), 387–423 (2005). https://doi.org/10.1007/s10817-005-9023-9
de Bruijn, N.G., van Ebbenhorst Tengbergen, C., Kruyswijk, D.: On the set of divisors of a number. Nieuw Archief voor Wiskunde, serie 2(23), 191–193 (1951)
Acknowledgements
The research described in this article started with a master internship supervized by Ph. Schnoebelen. It has also benefited from numerous discussions and suggestions from M. Džamonja, S. Halfon, and S. Schmitz. We also thank the reviewers for their thorough feedback.
Funding
This work was supported by ANR project BRAVAS (grant ANR-17-CE40-0028) and the École Polytechnique AMX program.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing interests
The author has no relevant financial or non-financial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Vialard, I. On the Width of the Cartesian Product of Ordinals. Order (2024). https://doi.org/10.1007/s11083-024-09668-8
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11083-024-09668-8