English

Length of an intersection

Logic 2015-10-05 v1 Combinatorics

Abstract

A poset \bfp\bfp is well-partially ordered (WPO) if all its linear extensions are well orders~; the supremum of ordered types of these linear extensions is the {\em length}, (\bfp)\ell(\bfp) of \bfp\bfp. We prove that if the vertex set XX of \bfp\bfp is infinite, of cardinality κ\kappa, and the ordering \leq is the intersection of finitely many partial orderings i\leq_i on XX, 1in1\leq i\leq n, then, letting (X,i)=κ\multordbyqi+ri\ell(X,\leq_i)=\kappa\multordby q_i+r_i, with ri<κr_i<\kappa, denote the euclidian division by κ\kappa (seen as an initial ordinal) of the length of the corresponding poset~:(\bfp)<κ\multordby1inqi+1inri+ \ell(\bfp)< \kappa\multordby\bigotimes_{1\leq i\leq n}q_i+ \Big|\sum_{1\leq i\leq n} r_i\Big|^+ where ri+|\sum r_i|^+ denotes the least initial ordinal greater than the ordinal ri\sum r_i. This inequality is optimal (for n2n\geq 2).

Keywords

Cite

@article{arxiv.1510.00596,
  title  = {Length of an intersection},
  author = {Christian Delhommé and Maurice Pouzet},
  journal= {arXiv preprint arXiv:1510.00596},
  year   = {2015}
}

Comments

13 pages

R2 v1 2026-06-22T11:11:23.486Z