Avoidable structures, II: Finite distributive lattices and nicely structured ordered sets

. Let be the ordered set of isomorphism types of finite distributive lattices, where the ordering is by embeddability. We characterize the order ideals in that are well-quasi-ordered by embeddability, and thus characterize the members of that belong to at least one infinite anti-chain in .

Saved in:
Bibliographic Details
Published in:Algebra universalis 2009-04, Vol.60 (3), p.259-291
Main Authors: Dziobiak, Wieslaw, Ježek, Jaroslav, McKenzie, Ralph
Format: Article
Language:English
Subjects:
Algebra
Mathematics
Mathematics and Statistics
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:. Let be the ordered set of isomorphism types of finite distributive lattices, where the ordering is by embeddability. We characterize the order ideals in that are well-quasi-ordered by embeddability, and thus characterize the members of that belong to at least one infinite anti-chain in .
ISSN:0002-5240
1420-8911
DOI:10.1007/s00012-009-2098-0