Representation of lattices via set-colored posets
From MaRDI portal
Publication:1800386
DOI10.1016/j.dam.2018.03.068OpenAlexW2801019962WikidataQ129882186 ScholiaQ129882186MaRDI QIDQ1800386
Lhouari Nourine, Michel A. Habib
Publication date: 23 October 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.068
latticerepresentation theoryantimatroidclosure systemupper locally distributive latticeset-colored poset
Knowledge representation (68T30) Structure and representation theory of distributive lattices (06D05)
Related Items (3)
Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ Translating between the representations of a ranked convex geometry ⋮ Submodular functions and rooted trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration aspects of maximal cliques and bicliques
- Homomorphisms and Ramsey properties of antimatroids
- Combinatorial representation and convex dimension of convex geometries
- The core of finite lattices
- \(T\)-colorings of graphs: recent results and open problems
- Primes, irreducibles and extremal lattices
- A characterization of semi-distributivity
- Generalizing semidistributivity
- The number of Moore families on \(n=6\)
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
- A simplicial elimination scheme for \(\wedge\)-semidistributive lattices and interval collapsing
- Chip-Firing, Antimatroids, and Polyhedra
- Convex Geometries
- Lattice Theory: Foundation
- Counting of Moore Families for n=7
- On the structure of all minimum cuts in a network and applications
- Erratum: The Stable Allocation (or Ordinal Transportation) Problem
- Partially Ordered Sets
- Representations of Lattices by Sets
- Efficient algorithms on distributive lattices
This page was built for publication: Representation of lattices via set-colored posets
