The length of chains in algebraic lattices

Details The length of chains in algebraic lattices The length of chains in algebraic lattices

2008-12-11

arxiv.org/abs/0812.2193v1

Mathematics

Combinatorics

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

Scientific paper

We 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 $\alpha$ of size $\kappa$, there is a set $\B$ of at most $2^{\kappa}$ join-semilattices, each one having a least element such that an algebraic lattice $L$ contains no chain of order type $I(\alpha)$ 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 $[\omega]^{<\omega}$ belonging to $\B$, one is embeddable in all the others. We conjecture that if $\alpha$ is countable, there is a finite set $\B$.

Affiliated with

Also associated with

No associations

Rating

The length of chains in algebraic lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The length of chains in algebraic lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The length of chains in algebraic lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-61061