Embedding median graphs into minimal distributive ∨-semi-lattices - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Embedding median graphs into minimal distributive ∨-semi-lattices

Alain Gély
Amedeo Napoli

Abstract

It is known that a distributive lattice is a median graph, and that a distributive ∨-semi-lattice can be thought of as a median graph i every triple of elements such that the inmum of each couple of its elements exists, has an inmum. Since a lattice without its bottom element is obviously a ∨-semi-lattice, using the FCA formalism, we investigate the following problem: Given a semi-lattice L obtained from a lattice by deletion of the bottom element, is there a minimum distributive ∨-semi-lattice L d such that L can be order embedded into L d ? We give a negative answer to this question by providing a counter example.
Fichier principal
Vignette du fichier
nfMCP2019-gely-al.pdf (505.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02912341 , version 1 (05-08-2020)

Identifiers

  • HAL Id : hal-02912341 , version 1

Cite

Alain Gély, Miguel Couceiro, Amedeo Napoli. Embedding median graphs into minimal distributive ∨-semi-lattices. NFMCP 2019 - 8th International Workshop on New Frontiers in Mining Complex Patterns in conjunction with ECML-PKDD 2019, Sep 2019, Wùzburg, Germany. ⟨hal-02912341⟩
52 View
81 Download

Share

Gmail Facebook Twitter LinkedIn More