On the public citation graph
A geometric description of modular lattices
0 signed · 40 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-0348-7633-9_5openalex-snapshot
Equational Classes of Lattices
inferredcites →https://doi.org/10.1007/bf01223687openalex-snapshot
Frink's theorem for modular lattices
inferredcites →https://doi.org/10.1007/bf01229766openalex-snapshot
Zum Wortproblem f�r freie Untermodulverb�nde
inferredcites →https://doi.org/10.1007/bf02483876openalex-snapshot
Finite sublattices of four-generated modular lattices
inferredcites →https://doi.org/10.1007/bf02485400openalex-snapshot
A test for identities satisfied in lattices of submodules
inferredcites →https://doi.org/10.1007/bf02945112openalex-snapshot
On free modular lattices generated by finite chains
inferredcites →https://doi.org/10.1016/0012-365x(91)90005-mopenalex-snapshot
The core of finite lattices
inferredcites →https://doi.org/10.1016/0021-8693(91)90061-copenalex-snapshot
Acyclic modular lattices and their representations
inferredcites →https://doi.org/10.1016/0022-4049(85)90091-xopenalex-snapshot
Diagrams for modular lattices
inferredcites →https://doi.org/10.1090/s0002-9947-1942-0007252-9openalex-snapshot
A Unified Theory of Projective Spaces and Finite Abelian Groups
inferredcites →https://doi.org/10.1090/s0002-9947-1981-0613799-9openalex-snapshot
Projective Geometry on Partially Ordered Sets
inferredcites →https://doi.org/10.1215/s0012-7094-66-03371-0openalex-snapshot
Equational classes of lattices
inferredcites →https://doi.org/10.7146/math.scand.a-10882openalex-snapshot
Equational Classes of Lattices.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-77867-5_4openalex-snapshot
Enumerating Maximal Consistent Closed Sets in Closure Systems
inferred← citeshttps://doi.org/10.1007/bf01190972openalex-snapshot
The minimal number of join irreducibles of a finite modular lattice
inferred← citeshttps://doi.org/10.1007/bf01200489openalex-snapshot
Alan Day's work on modular and Arguesian lattices
inferred← citeshttps://doi.org/10.1007/s00012-004-1843-7openalex-snapshot
Lattices of algebraic subsets
inferred← citeshttps://doi.org/10.1007/s00012-005-1878-4openalex-snapshot
Sublattices of complete lattices with continuity conditions
inferred← citeshttps://doi.org/10.1007/s00012-011-0112-9openalex-snapshot
On the number of join irreducibles and acyclicity in finite modular lattices
inferred← citeshttps://doi.org/10.1007/s00012-018-0559-zopenalex-snapshot
Tight embedding of modular lattices into partition lattices: progress and program
inferred← citeshttps://doi.org/10.1007/s00012-023-00840-6openalex-snapshot
Finitely based congruence varieties
inferred← citeshttps://doi.org/10.1007/s10469-026-09820-wopenalex-snapshot
New Results for Algebraic Lattices
inferred← citeshttps://doi.org/10.1007/s11083-007-9056-2openalex-snapshot
On Locally Finite Modular Lattice Varieties of Finite Height
inferred← citeshttps://doi.org/10.1007/s11083-011-9225-1openalex-snapshot
Varieties of Lattices with Geometric Descriptions
inferred← citeshttps://doi.org/10.1007/s11083-019-09516-0openalex-snapshot
A Compact Representation for Modular Semilattices and Its Applications
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90235-lopenalex-snapshot
Cover preserving embedding of modular lattices into partition lattices
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.disc.2007.03.023openalex-snapshot
Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid
inferred← citeshttps://doi.org/10.1016/s0001-8708(02)00011-7openalex-snapshot
Join-semidistributive lattices and convex geometries
inferred← citeshttps://doi.org/10.1109/jiot.2025.3576929openalex-snapshot
Two-Round Identity-Based Proxy Blind Signature Scheme on Lattices
inferred← citeshttps://doi.org/10.1142/s021819670400175xopenalex-snapshot
SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III: THE CASE OF TOTALLY ORDERED SETS
inferred← citeshttps://doi.org/10.1142/s0218196796000210openalex-snapshot
A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY
inferred← citeshttps://doi.org/10.1142/s0219061306000499openalex-snapshot
VON NEUMANN COORDINATIZATION IS NOT FIRST-ORDER
inferred← citeshttps://doi.org/10.48550/arxiv.1102.2195openalex-snapshot
Varieties of lattices with geometric descriptions
inferred← citeshttps://doi.org/10.48550/arxiv.1704.03715openalex-snapshot
Tight embedding of modular lattices into partition lattices: progress and program
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.