On the public citation graph

Matchings and radon transforms in lattices. I. Consistent lattices

https://doi.org/10.1007/bf00334848
0 signed · 31 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-1-4899-3558-8_21openalex-snapshot
Proof of a Conjecture on Finite Modular Lattices
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.1007/bf02485838openalex-snapshot
Combinatorial inequalities for semimodular lattices of breadth two
inferredcites →https://doi.org/10.1016/0097-3165(79)90059-1openalex-snapshot
The radon transforms of a combinatorial geometry, I
inferredcites →https://doi.org/10.1016/0097-3165(82)90047-4openalex-snapshot
Matching in modular lattices
inferredcites →https://doi.org/10.1090/s0002-9939-1973-0311527-9openalex-snapshot
Maximal Sublattices of Finite Distributive Lattices
inferredcites →https://doi.org/10.1090/s0002-9939-1974-0360393-5openalex-snapshot
Maximal Sublattices of Finite Distributive Lattices. II
inferredcites →https://doi.org/10.1090/s0002-9939-1975-0354422-3openalex-snapshot
Whitney Number Inequalities for Geometric Lattices
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0357163-6openalex-snapshot
Modular Constructions for Combinatorial Geometries
inferredcites →https://doi.org/10.2307/1969639openalex-snapshot
Proof of a Conjecture on Finite Modular Lattices

What points at this work

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

inferred← citeshttps://doi.org/10.1006/aama.1997.0536openalex-snapshot
Three Notes on Distributive Lattices
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_19openalex-snapshot
The Impact of Dilworth’s Work on Semimodular Lattices on the Kurosch-Ore Theorem
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_25openalex-snapshot
Dilworth’s Covering Theorem for Modular Lattices
inferred← citeshttps://doi.org/10.1007/bf02170062openalex-snapshot
The Kurosh-Ore exchange property
inferred← citeshttps://doi.org/10.1007/bf02188203openalex-snapshot
A converse to the Kurosh-Ore theorem
inferred← citeshttps://doi.org/10.1007/bf02925187openalex-snapshot
Hereditarily strong lattices
inferred← citeshttps://doi.org/10.1007/s000120050063openalex-snapshot
Consistent lattices and Steinitz spaces
inferred← citeshttps://doi.org/10.1007/s10469-017-9443-8openalex-snapshot
Decompositions in Complete Lattices II. Replaceable Irredundant Decompositions
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90013-6openalex-snapshot
Matchings for linearly indecomposable modular lattices
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90668-6openalex-snapshot
Invertibility of the base Radon transform of a matroid
inferred← citeshttps://doi.org/10.1016/0097-3165(92)90006-gopenalex-snapshot
Consistent dually semimodular lattices
inferred← citeshttps://doi.org/10.1016/0920-5632(88)90011-4openalex-snapshot
Reconstructing finite radon transforms
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50033-6openalex-snapshot
10.1016/b978-044488002-4/50033-6
inferred← citeshttps://doi.org/10.1016/b978-044488355-1/50008-6openalex-snapshot
Dimensional Linear Spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.031openalex-snapshot
The pruning-grafting lattice of binary trees
inferred← citeshttps://doi.org/10.1016/s1570-7954(96)80009-xopenalex-snapshot
Matroids
inferred← citeshttps://doi.org/10.1017/s0305004100066573openalex-snapshot
Matchings and Radon transforms in lattices II. Concordant sets
inferred← citeshttps://doi.org/10.1080/00207160304677openalex-snapshot
Matchings In Three Catalan Lattices
inferred← citeshttps://doi.org/10.21136/mb.1996.125944openalex-snapshot
On centrally symmetric graphs
inferred← citeshttps://doi.org/10.4064/dm392-0-1openalex-snapshot
Decompositions in lattices and some representations of algebras
inferred← citeshttps://doi.org/10.70675/148c5200zc441z43c1z9b85z7bb2f5ddc335openalex-snapshot
Algorithms on closure systems and their representations
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.