Meet-distributive lattices and the anti-exchange closure

1980/12/01 by Paul H. Edelman · 10 citations
Computer Science · Mathematics · #Advanced Algebra and Logic #Closed set #Closure (psychology) #Closure operator #Combinatorics #Complete lattice #Condensed matter physics #Congruence lattice problem #Discrete mathematics #Distributive lattice #Distributive property #Generalization #Lattice (music) #Law #Map of lattices #Mathematical analysis #Mathematics #Physics #Political science #Pure mathematics #Reciprocal lattice #Rough Sets and Fuzzy Logic #Universality (dynamical systems)

paper · doi:10.1007/bf02482912

crossref issued 1980/12/01 · crossref published 1980/12/01 · crossref published-print 1980/12/01 · openalex publication_date 1980/12/01 · crossref created 2006/09/18 · crossref deposited 2019/05/17 · openalex created_date 2025/10/10 · crossref indexed 2026/03/21 · openalex updated_date 2026/07/29

Citations

• On the foundations of combinatorial theory I. Theory of M�bius Functions

Cited by

• Join-semidistributive lattices and convex geometries
• Chip-firing Games on Graphs
• The sorting order on a Coxeter group
• An algorithmic characterization of antimatroids
• Convexity in Graphs and Hypergraphs
• Combinatorial representation and convex dimension of convex geometries
• The convexity lattice of a poset
• The forbidden minor characterization of line-search antimatroids of rooted digraphs
• Coordinatization of finite join-distributive lattices
• Antimatroid [wikipedia]