Representation of lattices via set-colored posets - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2018

Representation of lattices via set-colored posets

Résumé

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.

Dates et versions

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

Identifiants

Citer

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⟩
178 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More