Embedding ordered sets into distributive lattices

DOI10.1007/S11083-015-9376-6MaRDI QIDQ2520717zbMATH OpenOpenAlexFDO

Authors C. 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

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

Recommendations

• Complexity of cover-preserving embeddings of bipartite orders into Boolean lattices
• Weak embeddings of posets to the Boolean lattice
• Embeddings of finite distributive lattices into products of chains
• On the embedding of distributive lattices into recursive polynomial degrees
• The complexity of the fixed point property

Cites work

• scientific article; zbMATH DE number 6006014 (Why is no real title available?)
• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• scientific article; zbMATH DE number 1554928 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• Canonical extensions of posets.
• Lattices and bases of Coxeter groups
• Order dimension, strong Bruhat order and lattice properties for posets
• Partially Ordered Sets
• The Complexity of the Partial Order Dimension Problem
• The complexity of embedding orders into small products of chains

Cited in

(13)

• Complexity of cover-preserving embeddings of bipartite orders into Boolean lattices
• Large Sets of Lattices without Order Embeddings
• \(\kappa\)-embeddings of ordered sets
• scientific article; zbMATH DE number 3887755 (Why is no real title available?)
• Closure operators, frames and neatest representations
• Distributive and completely distributive lattice extensions of ordered sets
• Recursive axiomatisations from separation properties
• Packing problems, dimensions and the tensor product of complete lattices
• Weak embeddings of posets to the Boolean lattice
• The logic of information in state spaces
• No finite axiomatizations for posets embeddable into distributive lattices
• Ordering the order of a distributive lattice by itself
• Embeddings of finite distributive lattices into products of chains

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2520717)