On the public citation graph
Groups of binary relations
0 signed · 21 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.1016/0021-8693(69)90119-7openalex-snapshot
Maximal subgroups of the semigroup of relations
inferredcites →https://doi.org/10.1090/surv/007.1openalex-snapshot
The Algebraic Theory of Semigroups, Volume I
inferredcites →https://doi.org/10.21136/cmj.1970.100989openalex-snapshot
On the semigroup of binary relations on a finite set
inferredcites →https://doi.org/10.2140/pjm.1970.35.743openalex-snapshot
On the semigroup of binary relations
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-662-21571-5_15openalex-snapshot
Subgroups of Binary Relations
inferred← citeshttps://doi.org/10.1007/bf02018162openalex-snapshot
Combinatorial properties of binary semigroups
inferred← citeshttps://doi.org/10.1007/bf02194850openalex-snapshot
Maximal submonoids of the semigroup of binary relations
inferred← citeshttps://doi.org/10.1007/bf02315969openalex-snapshot
Finite binary relations have no more complexity than finite functions
inferred← citeshttps://doi.org/10.1007/bf02573047openalex-snapshot
A proof of the montague-plemmons-schein theorem on maximal subgroups of the semigroup of binary relations
inferred← citeshttps://doi.org/10.1007/s00233-011-9305-yopenalex-snapshot
A proof of Devadze’s theorem on generators of the semigroup of Boolean matrices
inferred← citeshttps://doi.org/10.1016/0022-4049(85)90061-1openalex-snapshot
Groupoids, idempotents and pointwise inverses in relational categories
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2011.02.048openalex-snapshot
Representation theory of finite semigroups over semirings
inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102415openalex-snapshot
Minimal generating sets for matrix monoids
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00180-4openalex-snapshot
Dedication to Robert J. Plemmons
inferred← citeshttps://doi.org/10.1017/s0017089500001683openalex-snapshot
Any group is a maximal subgroup of the semigroup of binary relations on some set
inferred← citeshttps://doi.org/10.1023/a:1015880225781openalex-snapshot
Complete Semigroups of Binary Relations Defined by Elementary and Nodal X-Semilattices of Unions
inferred← citeshttps://doi.org/10.1023/a:1025030132270openalex-snapshot
Complete Semigroups of Binary Relations
inferred← citeshttps://doi.org/10.21136/cmj.1975.101317openalex-snapshot
A matrix characterization of the maximal groups in $\beta_X$
inferred← citeshttps://doi.org/10.2140/pjm.1975.58.437openalex-snapshot
A characterization of the maximal monoids and maximal groups inβX
inferred← citeshttps://doi.org/10.48550/arxiv.2012.10323openalex-snapshot
Minimal generating sets for matrix monoids
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.