English

The length of chains in algebraic lattices

Combinatorics 2008-12-12 v1 Logic

Abstract

We study how the existence in an algebraic lattice LL of a chain of a given type is reflected in the join-semilattice K(L)K(L) of its compact elements. We show that for every chain α\alpha of size κ\kappa, there is a set \B\B of at most 2κ2^{\kappa} join-semilattices, each one having a least element such that an algebraic lattice LL contains no chain of order type I(α)I(\alpha) if and only if the join-semilattice K(L)K(L) of its compact elements contains no join-subsemilattice isomorphic to a member of \B\B. We show that among the join-subsemilattices of [ω]<ω[\omega]^{<\omega} belonging to \B\B, one is embeddable in all the others. We conjecture that if α\alpha is countable, there is a finite set \B\B.

Keywords

Cite

@article{arxiv.0812.2193,
  title  = {The length of chains in algebraic lattices},
  author = {Ilham Chakir and Maurice Pouzet},
  journal= {arXiv preprint arXiv:0812.2193},
  year   = {2008}
}

Comments

11 pages, 2 figures, Proceedings ISOR'08, Algiers, Nov. 2-6, 2008