On the public citation graph

Reducible classes of finite lattices

https://doi.org/10.1007/bf00405597
0 signed · 23 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_17openalex-snapshot
The Consequences of Dilworth’s Work on Lattices with Unique Irreducible Decompositions
inferredcites →https://doi.org/10.1007/978-3-663-12478-8openalex-snapshot
Semimodular Lattices
inferredcites →https://doi.org/10.1007/bf02483085openalex-snapshot
Modular lattices of dimension two
inferredcites →https://doi.org/10.1016/0012-365x(81)90201-6openalex-snapshot
A structure theory for ordered sets
inferredcites →https://doi.org/10.1016/0165-4896(94)00731-4openalex-snapshot
Permutation lattices revised
inferredcites →https://doi.org/10.1016/0165-4896(94)00733-0openalex-snapshot
On permutation lattices
inferredcites →https://doi.org/10.1016/0167-7799(91)90054-lopenalex-snapshot
Predicting antigenic sites on proteins
inferredcites →https://doi.org/10.1016/0195-6698(92)90041-wopenalex-snapshot
Les treillis pseudocomple´mente´s finis
inferredcites →https://doi.org/10.1017/cbo9780511809088openalex-snapshot
Introduction to Lattices and Order
inferredcites →https://doi.org/10.1090/s0002-9939-1974-0329988-9openalex-snapshot
On Modular Lattices of Order Dimension Two
inferredcites →https://doi.org/10.4153/cjm-1974-120-2openalex-snapshot
Crowns, Fences, and Dismantlable Lattices
inferredcites →https://doi.org/10.4153/cjm-1975-074-0openalex-snapshot
Planar Lattices
inferredcites →https://doi.org/10.4153/cmb-1974-016-3openalex-snapshot
Lattices with Doubly Irreducible Elements

What points at this work

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

inferred← citeshttps://doi.org/10.1006/eujc.2000.0432openalex-snapshot
Reducibility in Finite Posets
inferred← citeshttps://doi.org/10.1007/s00199-004-0544-yopenalex-snapshot
Designer path independent choice functions
inferred← citeshttps://doi.org/10.1007/s10587-009-0018-2openalex-snapshot
Going down in (semi)lattices of finite moore families and convex geometries
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.008openalex-snapshot
Reducibility number
inferred← citeshttps://doi.org/10.1016/s0165-4896(00)00076-7openalex-snapshot
Locally complete path independent choice functions and their lattices
inferred← citeshttps://doi.org/10.1023/a:1006473619786openalex-snapshot
Collection of Finite Lattices Generated by a Poset
inferred← citeshttps://doi.org/10.22436/jmcs.03.02.07openalex-snapshot
Characterization The Deletable Set Of Vertices In The ( P - 3 )- Regular Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.309openalex-snapshot
Some lattices of closure systems on a finite set
inferred← citeshttps://doi.org/10.46298/lmcs-20(3:11)2024openalex-snapshot
Isolated Suborders and their Application to Counting Closure Operators
inferred← citeshttps://doi.org/10.7151/dmgaa.1065openalex-snapshot
Finite orders and their minimal strict completion lattices
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.