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

Abstract

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

Keywords

• Avoidable
• structures
• Finite
• distributive
• lattices
• nicely
• structured
• ordered
• sets