On the public citation graph
Automorphisms and products of ordered sets
0 signed · 18 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-94-009-7798-3_1openalex-snapshot
Arithmetic of Ordered Sets
inferredcites →https://doi.org/10.1016/0001-8708(79)90045-8openalex-snapshot
Fixed points in partially ordered sets
inferredcites →https://doi.org/10.1016/0012-365x(84)90188-2openalex-snapshot
Isotone relations and the fixed point property for posets
inferredcites →https://doi.org/10.2307/1969532openalex-snapshot
On Direct Product Decomposition of Partially Ordered Sets
inferredcites →https://doi.org/10.4064/fm-55-3-249-281openalex-snapshot
Refinement properties for relational structures
inferredcites →https://doi.org/10.4153/cmb-1980-031-2openalex-snapshot
Retracts and the Fixed Point Problem for Finite Partially Ordered Sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01192707openalex-snapshot
The automorphism group of a function lattice: A problem of Jónsson and McKenzie
inferred← citeshttps://doi.org/10.1007/s40065-012-0049-7openalex-snapshot
The fixed point property for ordered sets
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90018-9openalex-snapshot
Strict refinement for graphs and digraphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2018.02.002openalex-snapshot
Products of abstract polytopes
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00273-4openalex-snapshot
Algorithms for the fixed point property
inferred← citeshttps://doi.org/10.18297/etd/2257openalex-snapshot
Order automorphisms on the lattice of residuated maps of some special nondistributive lattices.
inferred← citeshttps://doi.org/10.26493/1855-3974.2584.68dopenalex-snapshot
The antiprism of an abstract polytope
inferred← citeshttps://doi.org/10.48550/arxiv.1603.03585openalex-snapshot
Products of abstract polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.2005.03255openalex-snapshot
An Issue Raised in 1978 by a Then-Future Editor-in-Chief of the Journal "Order": Does the Endomorphism Poset of a Finite Connected Poset Tell Us That the Poset Is Connected?
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.