On the public citation graph

Idempotents and product representations with applications to the semigroup of binary relations

https://doi.org/10.1007/bf02572880
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.
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/bf02572873openalex-snapshot
The Schützenberger group of anH-class in the semigroup of binary relations
inferredcites →https://doi.org/10.1007/bf02572945openalex-snapshot
On (0,1)-matrix semigroups
inferredcites →https://doi.org/10.1007/bfb0059420openalex-snapshot
Binary relations
inferredcites →https://doi.org/10.1063/1.3060724openalex-snapshot
An Introduction to Combinatorial Analysis
inferredcites →https://doi.org/10.1090/surv/007.1/01openalex-snapshot
Elementary concepts
inferredcites →https://doi.org/10.2307/2002374openalex-snapshot
An Introduction to Combinatorial Analysis
inferredcites →https://doi.org/10.2307/2343055openalex-snapshot
Introduction to Combinatorial Analysis.

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-94-017-1291-0_3openalex-snapshot
Relational Representations of Hyper-Continuous Lattices
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/bf02483096openalex-snapshot
The representation of posets and lattices by sets
inferred← citeshttps://doi.org/10.1007/bf02505909openalex-snapshot
Binary relations as lattice isomorphisms
inferred← citeshttps://doi.org/10.1007/bf02572509openalex-snapshot
Regularity and complete distributivity
inferred← citeshttps://doi.org/10.1007/bf02572554openalex-snapshot
Idempotent boolean matrices
inferred← citeshttps://doi.org/10.1007/s00233-004-0179-0openalex-snapshot
Regular Relations and Normality of Topologies
inferred← citeshttps://doi.org/10.1007/s00233-009-9185-6openalex-snapshot
Conjugative relations and applications
inferred← citeshttps://doi.org/10.1007/s00233-011-9311-0openalex-snapshot
On regularity of sup-preserving maps: generalizing Zareckiĭ’s theorem
inferred← citeshttps://doi.org/10.1007/s00233-011-9364-0openalex-snapshot
Dually normal relations on sets
inferred← citeshttps://doi.org/10.1007/s00233-019-10042-zopenalex-snapshot
Weak finitely regular relations and applications
inferred← citeshttps://doi.org/10.1016/0024-3795(75)90054-3openalex-snapshot
On generalized inverses of Boolean Matrices
inferred← citeshttps://doi.org/10.1016/s0166-8641(03)00108-1openalex-snapshot
Regular relations and strictly completely regular ordered spaces
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.1023/a:1025096800410openalex-snapshot
Semigroups of Binary Relations with Right Units
inferred← citeshttps://doi.org/10.1109/icmt.2011.6002113openalex-snapshot
Fitting relations on sets and applications
inferred← citeshttps://doi.org/10.1142/s0252959904000160openalex-snapshot
REGULAR RELATIONS AND MONOTONE NORMAL ORDERED SPACES
inferred← citeshttps://doi.org/10.1142/s179355711750036xopenalex-snapshot
Normally conjugative relations
inferred← citeshttps://doi.org/10.1142/s1793830923500325openalex-snapshot
Strongly bi-conjugative relation — A new element in the class of bi-conjugative relations
inferred← citeshttps://doi.org/10.12677/pm.2015.54024openalex-snapshot
Join Dense Embeddings of Posets in Completely Distributive Lattices
inferred← citeshttps://doi.org/10.1515/math-2019-0136openalex-snapshot
Split Hausdorff internal topologies on posets
inferred← citeshttps://doi.org/10.1515/math-2022-0010openalex-snapshot
Relational representations of algebraic lattices and their applications
inferred← citeshttps://doi.org/10.20944/preprints202310.0646.v1openalex-snapshot
Some Remarks about Regular Relations
inferred← citeshttps://doi.org/10.2298/fil1702183iopenalex-snapshot
Moore-Penrose equations in involutive residuated semigroups and involutive quantales
inferred← citeshttps://doi.org/10.2298/pim1307127ropenalex-snapshot
Quasi-regular relations: A new class of relations on sets
inferred← citeshttps://doi.org/10.5666/kmj.2015.55.3.541openalex-snapshot
Quasi-Normal Relations - a New Class of Relations
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.