On the public citation graph
Semigroups of order 8
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.1016/b978-0-08-012975-4.50026-6openalex-snapshot
Construction and analysis of non-equivalent finite semigroups
inferredcites →https://doi.org/10.1090/s0002-9939-1976-0414380-0openalex-snapshot
The number of semigroups of order 𝑛
inferredcites →https://doi.org/10.1090/surv/007.1openalex-snapshot
The Algebraic Theory of Semigroups, Volume I
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-3817-8_1openalex-snapshot
Profinite semigroups and applications
inferred← citeshttps://doi.org/10.1007/978-3-540-85110-3_7openalex-snapshot
The Monoids of Order Eight and Nine
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_63openalex-snapshot
The Semigroups of Order 10
inferred← citeshttps://doi.org/10.1007/978-3-642-60539-0_9openalex-snapshot
Algorithms for computing finite semigroups
inferred← citeshttps://doi.org/10.1007/978-3-662-46439-7_5openalex-snapshot
A Primer on Economic Choice Automata
inferred← citeshttps://doi.org/10.1007/bf02573529openalex-snapshot
The number of commutative semigroups of order N
inferred← citeshttps://doi.org/10.1007/bf02574129openalex-snapshot
Computing finite commutative semigroups
inferred← citeshttps://doi.org/10.1007/s00026-004-0213-7openalex-snapshot
Combinatorics of Nilpotents in Symmetric Inverse Semigroups
inferred← citeshttps://doi.org/10.1007/s00233-006-0629-yopenalex-snapshot
Computing Finite Semigroups, I: The First Row
inferred← citeshttps://doi.org/10.1007/s00233-006-0630-5openalex-snapshot
Computing Finite Semigroups, II: The First Nonconstant Row
inferred← citeshttps://doi.org/10.1007/s00233-013-9504-9openalex-snapshot
The semigroups of order 9 and their automorphism groups
inferred← citeshttps://doi.org/10.1007/s00233-014-9602-3openalex-snapshot
Ordered semigroups of size at most 7 and linearly ordered semigroups of size at most 10
inferred← citeshttps://doi.org/10.1007/s00233-017-9869-2openalex-snapshot
Enumerating transformation semigroups
inferred← citeshttps://doi.org/10.1007/s00233-019-10054-9openalex-snapshot
Enumeration of finite inverse semigroups
inferred← citeshttps://doi.org/10.1007/s00285-023-01898-5openalex-snapshot
Semigroup models for biochemical reaction networks
inferred← citeshttps://doi.org/10.1007/s10472-009-9140-yopenalex-snapshot
The monoids of orders eight, nine & ten
inferred← citeshttps://doi.org/10.1088/1742-6596/1085/5/052010openalex-snapshot
On a Java library to perform S-expansions of Lie algebras
inferred← citeshttps://doi.org/10.1088/1742-6596/1085/5/052011openalex-snapshot
On the algorithm to find S-related Lie algebras
inferred← citeshttps://doi.org/10.1088/1751-8113/46/22/225201openalex-snapshot
Bianchi spaces and their three-dimensional isometries asS-expansions of two-dimensional isometries
inferred← citeshttps://doi.org/10.1088/1751-8113/46/36/365204openalex-snapshot
General properties of the expansion methods of Lie algebras
inferred← citeshttps://doi.org/10.1112/s0024611500012144openalex-snapshot
On the Decidability of Iterated Semidirect Products with Applications to Complexity
inferred← citeshttps://doi.org/10.3390/axioms14100735openalex-snapshot
A Java Library to Perform S-Expansions of Lie Algebras
inferred← citeshttps://doi.org/10.37236/2441openalex-snapshot
The Number of Nilpotent Semigroups of Degree 3
inferred← citeshttps://doi.org/10.48550/arxiv.1201.3529openalex-snapshot
The number of nilpotent semigroups of degree 3
inferred← citeshttps://doi.org/10.48550/arxiv.1502.07150openalex-snapshot
Finite Diagram Semigroups: Extending the Computational Horizon
inferred← citeshttps://doi.org/10.48550/arxiv.1812.02511openalex-snapshot
On some groupoids of small orders with Bol-Moufang type of identities
inferred← citeshttps://doi.org/10.48550/arxiv.2002.04072openalex-snapshot
Finite Coverings of Semigroups and Related Structures
inferred← citeshttps://doi.org/10.4995/agt.2008.1795openalex-snapshot
Semigroups and their topologies arising from Green's left quasiorder
inferred← citeshttps://doi.org/10.70675/ec6896efz3abdz4ab1z88d4z575bc710070dopenalex-snapshot
Iterated morphisms, combinatorics on words and symbolic dynamical systems
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.