Representation of lattices via set-colored posets - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2018

Representation of lattices via set-colored posets

(1, 2) , (3)
1
2
3

Abstract

This paper proposes a representation theory for any finite lattice via set-colored posets, in the spirit of Birkhoff for distributive lattices. The notion of colored posets was introduced in Nourine (2000) [34] and the generalization to set-colored posets was given in Nourine (2000) [35]. In this paper, we give a characterization of set-colored posets for general lattices, and show that set-colored posets capture the order induced by join-irreducible elements of a lattice as Birkhoff’s representation does for distributive lattices. We also give a classification for some lattices according to the coloring property of their set-colored representation including upper locally distributive, upper locally distributive, meet-extremal and semidistributive lattices.
Not file

Dates and versions

hal-01955233 , version 1 (14-12-2018)

Identifiers

Cite

Michel Habib, Lhouari Nourine. Representation of lattices via set-colored posets. Discrete Applied Mathematics, 2018, 249, pp.64-73. ⟨10.1016/j.dam.2018.03.068⟩. ⟨hal-01955233⟩
168 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More