On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Džamonja, Mirna, Schmitz, Sylvain, Schnoebelen, Philippe
Formato: Preprint
Publicado: 2017
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866917904356737024
author Džamonja, Mirna
Schmitz, Sylvain
Schnoebelen, Philippe
author_facet Džamonja, Mirna
Schmitz, Sylvain
Schnoebelen, Philippe
contents We investigate the ordinal invariants height, length, and width of well quasi orders (WQO), with particular emphasis on width, an invariant of interest for the larger class of orders with finite antichain condition (FAC). We show that the width in the class of FAC orders is completely determined by the width in the class of WQOs, in the sense that if we know how to calculate the width of any WQO then we have a procedure to calculate the width of any given FAC order. We show how the width of WQO orders obtained via some classical constructions can sometimes be computed in a compositional way. In particular, this allows proving that every ordinal can be obtained as the width of some WQO poset. One of the difficult questions is to give a complete formula for the width of Cartesian products of WQOs. Even the width of the product of two ordinals is only known through a complex recursive formula. Although we have not given a complete answer to this question we have advanced the state of knowledge by considering some more complex special cases and in particular by calculating the width of certain products containing three factors. In the course of writing the paper we have discovered that some of the relevant literature was written on cross-purposes and some of the notions re-discovered several times. Therefore we also use the occasion to give a unified presentation of the known results. ERRATUM:We incorrectly claimed in Lemma 4.4(1) the formula $o(P\cdot Q)=o(P)\cdot o(Q)$ for wpos $P$ and $Q$ and incorrectly attributed it to Abraham and Bonnet. We incorrectly claimed in 4.4(2) that the formula for $h(P\cdot Q)$ was due to Abraham and Bonnet.
format Preprint
id arxiv_https___arxiv_org_abs_1711_00428
institution arXiv
publishDate 2017
record_format arxiv
spellingShingle On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
Džamonja, Mirna
Schmitz, Sylvain
Schnoebelen, Philippe
Logic
Combinatorics
03, 05
We investigate the ordinal invariants height, length, and width of well quasi orders (WQO), with particular emphasis on width, an invariant of interest for the larger class of orders with finite antichain condition (FAC). We show that the width in the class of FAC orders is completely determined by the width in the class of WQOs, in the sense that if we know how to calculate the width of any WQO then we have a procedure to calculate the width of any given FAC order. We show how the width of WQO orders obtained via some classical constructions can sometimes be computed in a compositional way. In particular, this allows proving that every ordinal can be obtained as the width of some WQO poset. One of the difficult questions is to give a complete formula for the width of Cartesian products of WQOs. Even the width of the product of two ordinals is only known through a complex recursive formula. Although we have not given a complete answer to this question we have advanced the state of knowledge by considering some more complex special cases and in particular by calculating the width of certain products containing three factors. In the course of writing the paper we have discovered that some of the relevant literature was written on cross-purposes and some of the notions re-discovered several times. Therefore we also use the occasion to give a unified presentation of the known results. ERRATUM:We incorrectly claimed in Lemma 4.4(1) the formula $o(P\cdot Q)=o(P)\cdot o(Q)$ for wpos $P$ and $Q$ and incorrectly attributed it to Abraham and Bonnet. We incorrectly claimed in 4.4(2) that the formula for $h(P\cdot Q)$ was due to Abraham and Bonnet.
title On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
topic Logic
Combinatorics
03, 05
url https://arxiv.org/abs/1711.00428