The length of chains in algebraic lattices

dc.creatorChakir, Ilham
dc.creatorPouzet, Maurice
dc.date2008-12-11
dc.date.accessioned2026-07-07T12:12:03Z
dc.date.available2026-07-07T12:12:03Z
dc.descriptionWe study how the existence in an algebraic lattice $L$ of a chain of a given type is reflected in the join-semilattice $K(L)$ of its compact elements. We show that for every chain $α$ of size $κ$, there is a set $\B$ of at most $2^κ$ join-semilattices, each one having a least element such that an algebraic lattice $L$ contains no chain of order type $I(α)$ if and only if the join-semilattice $K(L)$ of its compact elements contains no join-subsemilattice isomorphic to a member of $\B$. We show that among the join-subsemilattices of $[ω]^{<ω}$ belonging to $\B$, one is embeddable in all the others. We conjecture that if $α$ is countable, there is a finite set $\B$.
dc.description11 pages, 2 figures, Proceedings ISOR'08, Algiers, Nov. 2-6, 2008
dc.identifierhttps://arxiv.org/abs/0812.2193
dc.identifierhttp://arxiv.org/abs/0812.2193
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/210423
dc.subjectCombinatorics
dc.subjectLogic
dc.subject06A12, 06B35
dc.titleThe length of chains in algebraic lattices
dc.typetext

Files

Collections