Embedding ordered sets into distributive lattices

DOI10.1007/s11083-015-9376-6zbMath1357.06002OpenAlexW2246642039MaRDI QIDQ2520717

Clint J. van Alten

Publication date: 16 December 2016

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-015-9376-6

zbMATH Keywords

NP-completenessordered setdistributive lattice

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Structure and representation theory of distributive lattices (06D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Distributive and completely distributive lattice extensions of ordered sets ⋮ CLOSURE OPERATORS, FRAMES AND NEATEST REPRESENTATIONS ⋮ No finite axiomatizations for posets embeddable into distributive lattices ⋮ THE LOGIC OF INFORMATION IN STATE SPACES ⋮ RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES

Cites Work

• Canonical extensions of posets.
• The complexity of embedding orders into small products of chains
• Lattices and bases of Coxeter groups
• Order dimension, strong Bruhat order and lattice properties for posets
• The Complexity of the Partial Order Dimension Problem
• Partially Ordered Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Embedding ordered sets into distributive lattices