The core of finite lattices

DOI10.1016/0012-365X(91)90005-MzbMATH Open0736.06012OpenAlexW4213137395MaRDI QIDQ1176723FDOQ1176723

Vincent Duquenne

Publication date: 25 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90005-m

zbMATH Keywords

modular latticesfunctional dependenciesmeet-distributive latticessemimodular latticesclosure operators on finite setsessential elementspartial lattice

Mathematics Subject Classification ID

Structure theory of lattices (06B05) Database theory (68P15) Semimodular lattices, geometric lattices (06C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lattice varieties covering the smallest non-modular variety
• A use for frequently rediscovering a concept
• Lattices with unique irreducible decompositions
• Single-element extensions of matroids
• Counting formulas for glued lattices
• Diagrams for modular lattices
• Projective Geometry on Partially Ordered Sets
• Subdirekte Produkte vollständiger Verbände.
• The arithmetical theory of Birkhoff lattices

Cited In (16)

• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• A class of infinite convex geometries
• On permutation lattices
• A geometric description of modular lattices
• Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors
• Optimum basis of finite convex geometry
• Surmise relations between tests -- preliminary results of the mathematical modeling
• Join-semidistributive lattices and convex geometries.
• Representation of lattices via set-colored posets
• The finite basis theorem for relatively normal lattices
• The presence of lattice theory in discrete problems of mathematical social sciences. Why.
• A depth-first search algorithm for computing pseudo-closed sets
• The joy of implications, aka pure Horn formulas: mainly a survey
• On the complexity of enumerating pseudo-intents
• Latticial structures in data analysis.
• Minimum implicational basis for \(\wedge\)-semidistributive lattices

This page was built for publication: The core of finite lattices

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