Lattice drawings and morphisms

Authors:
Vincent Duquenne
Affiliations:
Equipe Combinatoire et Optimisation, CNRS S Université Pierre et Marie Curie, Paris, France
Venue:
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Year:
2010

Citing 3
Cited 0

The core of finite lattices

Discrete Mathematics
Latticial structures in data analysis

Theoretical Computer Science
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let L → H be a lattice homomorphism and let a “readable” drawing of H be given. It is natural to make use of it to try getting a clear(er) drawing of L. Hence, the following question is explored: How the knowledge of the congruence lattice Con(L) of L can help in getting “better” drawings of L? This will be done by proposing rank shelling procedures of (M(Con(L),≤) and will be illustrated with examples coming either from math. or social sciences.