This communication is a historical note on the many rediscoveries of lower semidistributive (LSD) lattices which included many different characterizations of LSD.
Cites work
- A lattice characterization of convexity
- Application of the join-irreducible excess function to semi-modular lattices
- Combinatorial reciprocity theorems
- Convexity closure operators
- Decomposition Theory for Lattices Without Chain Conditions
- Distributive properties in semi-modular lattices
- Generalized convexity lattices
- scientific article; zbMATH DE number 3777200 (Why is no real title available?)
- scientific article; zbMATH DE number 3777562 (Why is no real title available?)
- scientific article; zbMATH DE number 3292656 (Why is no real title available?)
- scientific article; zbMATH DE number 3294629 (Why is no real title available?)
- Ideals in Birkhoff Lattices
- Increase in the join-excess function in a lattice
- Lattices with unique irreducible decompositions
- Locally atomic upper locally distributive lattices
- Meet-distributive lattices and the anti-exchange closure
- Natural Partial Orders
- Semihomomorphisms of Semimodular Lattices
- Submodular functions and independence structures
- Sur l'ensemble ordonné des parties connexes d'un graphe connexe
- The lattice of convex sets of an oriented matroid
- The lattice of natural partial orders
- The representation of posets and lattices by sets
- The subposet lattice and the order polynomial
- Treillis de Séparation des Graphes
Cited in
(28)- The core of finite lattices
- Concordance between two linear orders: The Spearman and Kendall coefficients revisited
- Closure systems and their structure
- Representation of convex geometries by circles on the plane
- How many ways can two composition series intersect?
- Closure spaces that are not uniquely generated
- Join-semidistributive lattices and convex geometries.
- On Brylawski's generalized duality
- Finite convex geometries of circles
- A discrete duality between nonmonotonic consequence relations and convex geometries
- Coordinatization of finite join-distributive lattices.
- Transformations of discrete closure systems
- Description of closure operators in convex geometries of segments on the line
- Optimum basis of finite convex geometry
- The max-flow min-cut property of two-dimensional affine convex geometries
- Enumeration in convex geometries and associated polytopal subdivisions of spheres
- Resolutions of convex geometries
- A class of infinite convex geometries
- Quasiplanar diagrams and slim semimodular lattices
- CD-independent subsets in meet-distributive lattices.
- Note on the description of join-distributive lattices by permutations
- On the number of atoms in three-generated lattices
- Notes on join semidistributive lattices
- A convex combinatorial property of compact sets in the plane and its roots in lattice theory
- Length-preserving extensions of a semimodular lattice by lowering a join-irreducible element
- Convex geometries yielded by transit functions
- Enumerating the irreducible closed sets of an acyclic implicational base of bounded degree
- Convexity in partial cubes: the hull number
This page was built for publication: A use for frequently rediscovering a concept
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762512)
