On the public citation graph
The representation of posets and lattices by sets
0 signed · 36 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-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-1-4899-3558-8_10openalex-snapshot
Lattices with Unique Irreducible Decompositions
inferredcites →https://doi.org/10.1007/bf02572873openalex-snapshot
The Schützenberger group of anH-class in the semigroup of binary relations
inferredcites →https://doi.org/10.1007/bf02572880openalex-snapshot
Idempotents and product representations with applications to the semigroup of binary relations
inferredcites →https://doi.org/10.1016/0025-5564(78)90088-3openalex-snapshot
A mathematical analysis of human leukocyte antigen serology
inferredcites →https://doi.org/10.1016/s0021-9800(68)80068-7openalex-snapshot
Recursive formulas on free distributive lattices
inferredcites →https://doi.org/10.1090/s0002-9939-1955-0074380-6openalex-snapshot
On the number of realizations of a Hasse diagram by finite sets
inferredcites →https://doi.org/10.1090/s0002-9947-1948-0027263-2openalex-snapshot
Representations of lattices by sets
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0360386-3openalex-snapshot
The Factorization and Representation of Lattices
inferredcites →https://doi.org/10.1112/blms/1.3.431openalex-snapshot
INTRODUCTION TO COMBINATORIAL MATHEMATICS
inferredcites →https://doi.org/10.2307/1968857openalex-snapshot
Lattices with Unique Irreducible Decompositions
inferredcites →https://doi.org/10.2307/2317652openalex-snapshot
Introduction to Combinatorial Mathematics.
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-45337-7_10openalex-snapshot
A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests
inferred← citeshttps://doi.org/10.1007/978-3-030-01162-8_3openalex-snapshot
Algebraic Methods for Granular Rough Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-15368-1_16openalex-snapshot
Topological Aspects of Matrix Abduction 1
inferred← citeshttps://doi.org/10.1007/978-3-319-54966-8_12openalex-snapshot
Knowledge and Consequence in AC Semantics for General Rough Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-85654-2_68openalex-snapshot
Hierarchy Encoding with Multiple Genes
inferred← citeshttps://doi.org/10.1007/bf00383950openalex-snapshot
Primes, irreducibles and extremal lattices
inferred← citeshttps://doi.org/10.1007/bf00582748openalex-snapshot
A use for frequently rediscovering a concept
inferred← citeshttps://doi.org/10.1007/s10773-017-3311-0openalex-snapshot
Dynamic Logic Assigned to Automata
inferred← citeshttps://doi.org/10.1007/s11083-009-9135-7openalex-snapshot
The Complexity of Embedding Orders into Small Products of Chains
inferred← citeshttps://doi.org/10.1016/0025-5564(83)90081-0openalex-snapshot
Necessary and sufficient conditions for a phenotype system to have a factor-union representation
inferred← citeshttps://doi.org/10.1016/j.datak.2003.12.001openalex-snapshot
Encoding multiple inheritance hierarchies for lattice operations
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.029openalex-snapshot
Computational aspects of the 2-dimension of partially ordered sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.025openalex-snapshot
On lattices from combinatorial game theory modularity and a representation theorem: Finite case
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00209-5openalex-snapshot
A data structure for lattice representation
inferred← citeshttps://doi.org/10.1023/a:1010662327346openalex-snapshot
Biclosed Binary Relations and Galois Connections
inferred← citeshttps://doi.org/10.1137/15m1030054openalex-snapshot
The Secret Life of Keys: On the Calculation of Mechanical Lock Systems
inferred← citeshttps://doi.org/10.1137/s0097539794274404openalex-snapshot
An Efficient Data Structure for Lattice Operations
inferred← citeshttps://doi.org/10.21136/cmj.1990.102367openalex-snapshot
Existence of prime ideals and ultrafilters in partially ordered sets
inferred← citeshttps://doi.org/10.31274/rtd-180813-11619openalex-snapshot
Compact posets and ramifiability of large cardinals
inferred← citeshttps://doi.org/10.4171/em/4openalex-snapshot
An interesting application of algebra to genetics
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.