On lattice representations with DCC posets

DOI10.1007/S11083-019-09489-0MaRDI QIDQ2183095zbMATH OpenOpenAlexFDO

Authors Gergő Gyenizse

Publication date 26 May 2020

Published in Order (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11083-019-09489-0

zbMATH Keywords

D relationDCC posetslattice representationlower bounded lattices

Mathematics Subject Classification ID

Structure theory of lattices (06B05) Representation theory of lattices (06B15)

Recommendations

• A characterization for non-DCC lattices
• Some combinatorial aspects of congruence lattice representations
• On the representation of distributive semilattices
• scientific article; zbMATH DE number 1481767
• Lattices of lattice paths

Cites work

• A representation theorem for lattices
• Every finite lattice can be embedded in a finite partition lattice
• scientific article; zbMATH DE number 3613103 (Why is no real title available?)
• scientific article; zbMATH DE number 758787 (Why is no real title available?)
• Join-semidistributive lattices and convex geometries.
• Lattices That are Embeddable in Suborder Lattices
• Lattices, equivalence relations, and subgroups
• THE LATTICE OF PERMUTATIONS IS BOUNDED

Cited in

(5)

• On discrete \(l\)-loops
• Representation of lattices via set-colored posets
• Representation of finite demi-\(p\)-lattices by means of posets
• A characterization for non-DCC lattices
• scientific article; zbMATH DE number 5043346 (Why is no real title available?)

This page was built for publication: On lattice representations with DCC posets

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