Meet-distributive lattices and the anti-exchange closure
From MaRDI portal
Publication:1143421
DOI10.1007/BF02482912zbMath0442.06004OpenAlexW1983739088WikidataQ56387983 ScholiaQ56387983MaRDI QIDQ1143421
Publication date: 1980
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02482912
Partial orders, general (06A06) Enumerative combinatorics (05A99) Zeta and (L)-functions: analytic theory (11M99) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Distributive lattices (06D99)
Related Items (76)
Exchange properties of combinatorial closure spaces ⋮ Representation of FS-domains based on closure spaces ⋮ Sublattices of lattices of order-convex sets. I: The main representation theorem ⋮ Topes of oriented matroids and related structures ⋮ Convexity in Graphs and Hypergraphs ⋮ Convex geometries are extremal for the generalized Sauer-Shelah bound ⋮ Homotopy properties of greedoids ⋮ An algorithmic characterization of antimatroids ⋮ Trees as semilattices ⋮ Homomorphisms and Ramsey properties of antimatroids ⋮ On semigroups with least generating sets ⋮ Alternating Whitney sums and matchings in trees. 1 ⋮ A convex combinatorial property of compact sets in the plane and its roots in lattice theory ⋮ A circuit set characterization of antimatroids ⋮ A representation of antimatroids by Horn rules and its application to educational systems ⋮ What convex geometries tell about shattering-extremal systems ⋮ Closure lattices ⋮ The Kurosh-Ore exchange property ⋮ CD-independent subsets in meet-distributive lattices. ⋮ CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE ⋮ Crosscut-simplicial lattices ⋮ Unnamed Item ⋮ Partition coefficients of acyclic graphs ⋮ Convexity in ordered matroids and the generalized external order ⋮ Excluded-minor characterizations of antimatroids arisen from posets and graph searches. ⋮ The forbidden minor characterization of line-search antimatroids of rooted digraphs ⋮ Decompositions in complete lattices. III: Unique irredundant decompositions and convex geometries ⋮ Antimatroids, Betweenness, Convexity ⋮ Matroidizing set systems: A new approach to matroid theory ⋮ The lattice of convex sets of an oriented matroid ⋮ Note on the description of join-distributive lattices by permutations ⋮ On the Weak Order of Coxeter Groups ⋮ ULD-Lattices and Δ-Bonds ⋮ SB-lattices, distributivity, and Bruhat order on sortable elements. ⋮ Choice resolutions ⋮ Two flags in a semimodular lattice generate an antimatroid ⋮ New representations of algebraic domains and algebraic L-domains via closure systems ⋮ On the shelling antimatroids of split graphs ⋮ A unified interpretation of several combinatorial dualities ⋮ Embedding convex geometries and a bound on convex dimension ⋮ Coordinatization of finite join-distributive lattices. ⋮ The max-flow min-cut property of two-dimensional affine convex geometries ⋮ Enumeration in convex geometries and associated polytopal subdivisions of spheres ⋮ Cellular structure for the Herzog-Takayama resolution ⋮ Transformations of Concept Graphs: ⋮ The duality between the anti-exchange closure operators and the path independent choice operators on a finite set ⋮ Closure operators and lattice extensions ⋮ Closure spaces that are not uniquely generated ⋮ The categorical equivalence between algebraic domains and F-augmented closure spaces. ⋮ Polymatroid greedoids ⋮ Finite convex geometries of circles ⋮ The intersection of matroids and antimatroids ⋮ Rectangular products of lattices ⋮ Description lattices of generalised convex hulls ⋮ Most uniform path partitioning and its use in image processing ⋮ An abstract duality ⋮ Representation of bifinite domains by BF-closure spaces ⋮ Matroids and antimatroids - a survey ⋮ On the NBC-complexes and \(\beta \)-invariants of abstract convex geometries ⋮ On the widths of finite distributive lattices ⋮ A use for frequently rediscovering a concept ⋮ Exchange systems ⋮ Unnamed Item ⋮ Rank axiom of modular supermatroids: a connection with directional DR submodular functions ⋮ Cooperative games on antimatroids ⋮ The sorting order on a Coxeter group. ⋮ The subposet lattice and the order polynomial ⋮ On the number of atoms in three-generated lattices ⋮ On the average number of nodes in a subtree of a tree ⋮ Direct products of convex-ordinal scales ⋮ Chip-firing games on graphs ⋮ A representation of continuous lattices based on closure spaces ⋮ Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes ⋮ Join-semidistributive lattices and convex geometries. ⋮ Values for interior operator games ⋮ Meet-distributive lattices have the intersection property
Cites Work
- Ordered structures and partitions
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- Combinatorial reciprocity theorems
- Unnamed Item
This page was built for publication: Meet-distributive lattices and the anti-exchange closure
