The length of chains in algebraic lattices
Combinatorics
2008-12-12 v1 Logic
Abstract
We study how the existence in an algebraic lattice of a chain of a given type is reflected in the join-semilattice of its compact elements. We show that for every chain of size , there is a set of at most join-semilattices, each one having a least element such that an algebraic lattice contains no chain of order type if and only if the join-semilattice of its compact elements contains no join-subsemilattice isomorphic to a member of . We show that among the join-subsemilattices of belonging to , one is embeddable in all the others. We conjecture that if is countable, there is a finite set .
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