On the public citation graph

Meet-distributive lattices and the anti-exchange closure

https://doi.org/10.1007/bf02482912
0 signed · 113 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-010-1826-5_16openalex-snapshot
Combinatorial Reciprocity Theorems
inferredcites →https://doi.org/10.1007/bf00531932openalex-snapshot
On the foundations of combinatorial theory I. Theory of M�bius Functions
inferredcites →https://doi.org/10.1016/0001-8708(74)90030-9openalex-snapshot
Combinatorial reciprocity theorems
inferredcites →https://doi.org/10.1090/memo/0119openalex-snapshot
Ordered structures and partitions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-60618-1_85openalex-snapshot
Partition coefficients of acyclic graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-87363-3_8openalex-snapshot
Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres
inferred← citeshttps://doi.org/10.1007/978-1-4684-9199-9_1openalex-snapshot
Origins and basic concepts
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_17openalex-snapshot
The Consequences of Dilworth’s Work on Lattices with Unique Irreducible Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-032-03364-2_25openalex-snapshot
Rises for Measuring Local Distributivity in Lattices
inferred← citeshttps://doi.org/10.1007/978-3-032-34742-8_10openalex-snapshot
Degrees of Distributivity: Quantifying Structural Deviations in Real World Data
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_3openalex-snapshot
Neighborhood Expansion Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_3openalex-snapshot
Antimatroids, Betweenness, Convexity
inferred← citeshttps://doi.org/10.1007/978-3-540-88011-0_24openalex-snapshot
Visualization of Cooperative Options for Small Maritime Companies
inferred← citeshttps://doi.org/10.1007/978-3-642-46908-4_79openalex-snapshot
On a Characterization of Closure Operators by Identities on Semigroups
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_23openalex-snapshot
Ordered Sets and Social Sciences
inferred← citeshttps://doi.org/10.1007/bf00143895openalex-snapshot
Combinatorial representation and convex dimension of convex geometries
inferred← citeshttps://doi.org/10.1007/bf00149365openalex-snapshot
The theory of convex geometries
inferred← citeshttps://doi.org/10.1007/bf00333128openalex-snapshot
The convexity lattice of a poset
inferred← citeshttps://doi.org/10.1007/bf00582748openalex-snapshot
A use for frequently rediscovering a concept
inferred← citeshttps://doi.org/10.1007/bf01108768openalex-snapshot
Direct products of convex-ordinal scales
inferred← citeshttps://doi.org/10.1007/bf02170062openalex-snapshot
The Kurosh-Ore exchange property
inferred← citeshttps://doi.org/10.1007/bf02575026openalex-snapshot
On semigroups with least generating sets
inferred← citeshttps://doi.org/10.1007/bfb0083463openalex-snapshot
Examples and algorithmic properties of greedoids
inferred← citeshttps://doi.org/10.1007/s00012-014-0282-3openalex-snapshot
Coordinatization of finite join-distributive lattices
inferred← citeshttps://doi.org/10.1007/s00012-014-0295-yopenalex-snapshot
Note on the description of join-distributive lattices by permutations
inferred← citeshttps://doi.org/10.1007/s00233-021-10209-7openalex-snapshot
New representations of algebraic domains and algebraic L-domains via closure systems
inferred← citeshttps://doi.org/10.1007/s00355-020-01285-9openalex-snapshot
Choice resolutions
inferred← citeshttps://doi.org/10.1007/s003730200039openalex-snapshot
Graphs and Balanced Simplicial Complexes
inferred← citeshttps://doi.org/10.1007/s00454-007-9020-3openalex-snapshot
Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres
inferred← citeshttps://doi.org/10.1007/s00454-025-00716-7openalex-snapshot
Geometry of Convex Geometries
inferred← citeshttps://doi.org/10.1007/s10469-017-9462-5openalex-snapshot
Decompositions in Complete Lattices III. Unique Irredundant Decompositions and Convex Geometries
inferred← citeshttps://doi.org/10.1007/s10474-013-0371-3openalex-snapshot
CD-independent subsets in meet-distributive lattices
inferred← citeshttps://doi.org/10.1007/s10479-005-2251-xopenalex-snapshot
Values for Interior Operator Games
inferred← citeshttps://doi.org/10.1007/s10801-014-0524-7openalex-snapshot
Cellular structure for the Herzog–Takayama resolution
inferred← citeshttps://doi.org/10.1007/s11083-004-5178-yopenalex-snapshot
Closure Operators and Lattice Extensions
inferred← citeshttps://doi.org/10.1007/s11083-014-9318-8openalex-snapshot
The Categorical Equivalence Between Algebraic Domains and F-Augmented Closure Spaces
inferred← citeshttps://doi.org/10.1007/s11083-016-9409-9openalex-snapshot
Crosscut-Simplicial Lattices
inferred← citeshttps://doi.org/10.1007/s11083-023-09639-5openalex-snapshot
Two Flags in a Semimodular Lattice Generate an Antimatroid
inferred← citeshttps://doi.org/10.1016/0001-8708(84)90042-2openalex-snapshot
Selectors: A theory of formal languages, semimodular lattices, and branching and shelling processes
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90007-0openalex-snapshot
On the widths of finite distributive lattices
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90026-4openalex-snapshot
Alternating Whitney sums and matchings in trees, part 1
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90012-xopenalex-snapshot
Exchange systems
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90094-5openalex-snapshot
An abstract duality
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90142-2openalex-snapshot
The intersection of matroids and antimatroids
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90180-5openalex-snapshot
Matroids and antimatroids—a survey
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90032-dopenalex-snapshot
Alternating Whitney sums and matchings in trees, part II
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00046-lopenalex-snapshot
Trees as semilattices
inferred← citeshttps://doi.org/10.1016/0012-365x(96)00043-xopenalex-snapshot
Closure lattices
inferred← citeshttps://doi.org/10.1016/0095-8956(82)90043-0openalex-snapshot
The lattice of convex sets of an oriented matroid
inferred← citeshttps://doi.org/10.1016/0095-8956(83)90049-7openalex-snapshot
On the average number of nodes in a subtree of a tree
inferred← citeshttps://doi.org/10.1016/0095-8956(85)90091-7openalex-snapshot
Polymatroid greedoids
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90007-4openalex-snapshot
A circuit set characterization of antimatroids
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90046-6openalex-snapshot
Exchange properties of combinatorial closure spaces
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90049-1openalex-snapshot
Homomorphisms and Ramsey properties of antimatroids
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90002-topenalex-snapshot
An algorithmic characterization of antimatroids
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90048-sopenalex-snapshot
Most uniform path partitioning and its use in image processing
inferred← citeshttps://doi.org/10.1016/0196-8858(85)90021-1openalex-snapshot
Homotopy properties of greedoids
inferred← citeshttps://doi.org/10.1016/0893-9659(90)90008-yopenalex-snapshot
Matroidizing set systems: a new approach to matroid theory
inferred← citeshttps://doi.org/10.1016/j.aam.2021.102304openalex-snapshot
Rank axiom of modular supermatroids: A connection with directional DR submodular functions
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.021openalex-snapshot
Closure spaces that are not uniquely generated
inferred← citeshttps://doi.org/10.1016/j.dam.2008.12.002openalex-snapshot
On the NBC-complexes and β -invariants of abstract convex geometries
inferred← citeshttps://doi.org/10.1016/j.disc.2003.10.019openalex-snapshot
Cooperative games on antimatroids
inferred← citeshttps://doi.org/10.1016/j.disc.2006.10.018openalex-snapshot
The max-flow min-cut property of two-dimensional affine convex geometries
inferred← citeshttps://doi.org/10.1016/j.disc.2014.04.017openalex-snapshot
Finite convex geometries of circles
inferred← citeshttps://doi.org/10.1016/j.disc.2016.10.006openalex-snapshot
Embedding convex geometries and a bound on convex dimension
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.08.002openalex-snapshot
A unified interpretation of several combinatorial dualities
inferred← citeshttps://doi.org/10.1016/j.endm.2016.10.049openalex-snapshot
On the shelling antimatroids of split graphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.07.029openalex-snapshot
Representation of FS-domains Based on Closure Spaces
inferred← citeshttps://doi.org/10.1016/j.fss.2026.109869openalex-snapshot
Representations of frame-valued algebraic dcpos and domains via closure spaces
inferred← citeshttps://doi.org/10.1016/j.ijar.2024.109269openalex-snapshot
Description lattices of generalised convex hulls
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2004.01.023openalex-snapshot
Sublattices of lattices of order-convex sets, I. The main representation theorem
inferred← citeshttps://doi.org/10.1016/j.jcta.2009.03.009openalex-snapshot
The sorting order on a Coxeter group
inferred← citeshttps://doi.org/10.1016/j.jmp.2016.09.002openalex-snapshot
A representation of antimatroids by Horn rules and its application to educational systems
inferred← citeshttps://doi.org/10.1016/s0001-8708(02)00011-7openalex-snapshot
Join-semidistributive lattices and convex geometries
inferred← citeshttps://doi.org/10.1016/s0165-4896(00)00061-5openalex-snapshot
The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00471-7openalex-snapshot
The forbidden minor characterization of line-search antimatroids of rooted digraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00581-4openalex-snapshot
Excluded-minor characterizations of antimatroids arisen from posets and graph searches
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80111-4openalex-snapshot
Chip-firing Games on Graphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(82)80018-8openalex-snapshot
The Subposet Lattice and the Order Polynomial
inferred← citeshttps://doi.org/10.1016/s0924-6509(09)70386-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s1385-7258(89)80024-1openalex-snapshot
Full and fundamental partial orderings
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00098-8openalex-snapshot
Excluded–Minor Characterizations of Antimatroids arisen from Posets and Graph Searches
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00185-9openalex-snapshot
Transformations of Concept Graphs:
inferred← citeshttps://doi.org/10.1017/s0963548309010001openalex-snapshot
ULD-Lattices and Δ-Bonds
inferred← citeshttps://doi.org/10.1017/s1755020321000356openalex-snapshot
CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE
inferred← citeshttps://doi.org/10.1023/a:1024463510392openalex-snapshot
Embedding Finite Lattices into Finite Biatomic Lattices
inferred← citeshttps://doi.org/10.1080/03081079.2017.1354798openalex-snapshot
Why concept lattices are large: extremal theory for generators, concepts, and VC-dimension
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22462.xopenalex-snapshot
Polyhedral Results for Antimatroidsa
inferred← citeshttps://doi.org/10.1137/0607049openalex-snapshot
Convexity in Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.14232/actasm-020-769-4openalex-snapshot
On the number of atoms in three-generated lattices
inferred← citeshttps://doi.org/10.1515/ms-2021-0004openalex-snapshot
Representation of bifinite domains by BF-closure spaces
inferred← citeshttps://doi.org/10.17265/2159-5291/2017.06.001openalex-snapshot
A Short Note on Compactness in Aligned Spaces and Higgs Spaces
inferred← citeshttps://doi.org/10.21136/mb.2019.0156-18openalex-snapshot
Distributive lattices have the intersection property
inferred← citeshttps://doi.org/10.21136/mb.2022.0072-21openalex-snapshot
Meet-distributive lattices have the intersection property
inferred← citeshttps://doi.org/10.23638/dmtcs-19-1-7openalex-snapshot
On the shelling antimatroids of split graphs
inferred← citeshttps://doi.org/10.29252/cgasa.11.1.57openalex-snapshot
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
inferred← citeshttps://doi.org/10.2977/prims/1195167272openalex-snapshot
Topes of Oriented Matroids and Related Structures
inferred← citeshttps://doi.org/10.2989/16073606.2020.1808864openalex-snapshot
A representation of continuous lattices based on closure spaces
inferred← citeshttps://doi.org/10.3233/jifs-200274openalex-snapshot
L -fuzzifying antimatroids: A fuzzy approach to the generalization of shelling precedence structures
inferred← citeshttps://doi.org/10.37236/10750openalex-snapshot
What Convex Geometries Tell About Shattering-Extremal Systems
inferred← citeshttps://doi.org/10.37236/4942openalex-snapshot
SB-Labelings, Distributivity, and Bruhat Order on Sortable Elements
inferred← citeshttps://doi.org/10.37236/7582openalex-snapshot
Convexity in Ordered Matroids and the Generalized External Order
inferred← citeshttps://doi.org/10.3934/math.2025781openalex-snapshot
Stably continuous semilattices in closure spaces
inferred← citeshttps://doi.org/10.4064/dm392-0-1openalex-snapshot
Decompositions in lattices and some representations of algebras
inferred← citeshttps://doi.org/10.4153/cjm-2017-059-0openalex-snapshot
On the Weak Order of Coxeter Groups
inferred← citeshttps://doi.org/10.4213/rm10231openalex-snapshot
Введение в теорию выбора и стабильных контрактов
inferred← citeshttps://doi.org/10.4213/rm10231eopenalex-snapshot
Introduction to the theory of choice and stable contracts
inferred← citeshttps://doi.org/10.46298/dmtcs.3602openalex-snapshot
The Sorting Order on a Coxeter Group
inferred← citeshttps://doi.org/10.48550/arxiv.1307.0900openalex-snapshot
CD-independent subsets in meet-distributive lattices
inferred← citeshttps://doi.org/10.48550/arxiv.1406.3721openalex-snapshot
Algebraic convex geometries revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1407.7507openalex-snapshot
SB-Labelings, Distributivity, and Bruhat Order on Sortable Elements
inferred← citeshttps://doi.org/10.48550/arxiv.1707.03459openalex-snapshot
The Tutte q-Polynomial
inferred← citeshttps://doi.org/10.68381/jca21005openalex-snapshot
Convexities on Ordered Structures Have Their Krein-Milman Theorem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.