On the public citation graph
Characterization of monoids by condition (P) of cyclic left acts
0 signed · 28 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.1002/mana.19710480124openalex-snapshot
Flatness and localization over monoids
inferredcites →https://doi.org/10.1007/bf01202495openalex-snapshot
On free, projective, and strongly flat acts
inferredcites →https://doi.org/10.1007/bf02194941openalex-snapshot
Right PP monoids with central idempotents
inferredcites →https://doi.org/10.1007/bf02572973openalex-snapshot
Projectivity of acts and morita equivalence of monoids
inferredcites →https://doi.org/10.1007/bf02573256openalex-snapshot
A characterization of left cancellative monoids by flatness properties
inferredcites →https://doi.org/10.1007/bf02573548openalex-snapshot
A characterization of regular monoids by flatness of left acts
inferredcites →https://doi.org/10.1007/bf02575023openalex-snapshot
On equalizer-flat and pullback-flat acts
inferredcites →https://doi.org/10.1007/bfb0062038openalex-snapshot
Characterization of monoids by properties of finitely generated right acts and their right ideals
inferredcites →https://doi.org/10.1016/0022-4049(87)90094-6openalex-snapshot
Characterization of monoids by properties of regular acts
inferredcites →https://doi.org/10.1016/0022-4049(88)90064-3openalex-snapshot
Wreath products of acts over monoids: I. regular and inverse acts
inferredcites →https://doi.org/10.1017/s0013091500018198openalex-snapshot
Monoids over which all weakly flat acts are flat
inferredcites →https://doi.org/10.1080/00927879208824478openalex-snapshot
Flat and strongly flat s-systems
inferredcites →https://doi.org/10.1080/00927879408824997openalex-snapshot
Monoids over which every flat right act satisfies condition (P)
inferredcites →https://doi.org/10.4153/cmb-1991-073-2openalex-snapshot
Pullback-Flat Acts are Strongly Flat
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01326031openalex-snapshot
Flatness properties of monocyclic acts
inferred← citeshttps://doi.org/10.1007/bf02573519openalex-snapshot
Monoids over which all flat cyclic right acts are strongly flat
inferred← citeshttps://doi.org/10.1007/bf02676607openalex-snapshot
Periodic monoids over which all flat cyclic right acts satisfy condition (P)
inferred← citeshttps://doi.org/10.1007/s002339900050openalex-snapshot
Flat acts that satisfy condition (P)
inferred← citeshttps://doi.org/10.1080/00927872.2015.1087010openalex-snapshot
On a Generalization of Weak Pullback Flatness
inferred← citeshttps://doi.org/10.1080/00927879408824997openalex-snapshot
Monoids over which every flat right act satisfies condition (P)
inferred← citeshttps://doi.org/10.1081/agb-100001547openalex-snapshot
PULLBACKS AND FLATNESS PROPERTIES OF ACTS. I
inferred← citeshttps://doi.org/10.1081/agb-100001548openalex-snapshot
PULLBACKS AND FLATNESS PROPERTIES OF ACTS. II
inferred← citeshttps://doi.org/10.1081/agb-120013320openalex-snapshot
STRONG FLATNESS PROPERTIES OF RIGHT S-ACTS SATISFYING CONDITION (P)
inferred← citeshttps://doi.org/10.1112/s0025579300007592openalex-snapshot
Flatness properties of acts over commutative, cancellative 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.