On the public citation graph

Permutation properties and the fibonacci semigroup

0 signed · 13 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/bf01229319openalex-snapshot
A permutational property of groups
inferredcites →https://doi.org/10.1016/0021-8693(84)90237-0openalex-snapshot
On the burnside problem for semigroups
inferredcites →https://doi.org/10.1016/0166-218x(83)90002-1openalex-snapshot
On cube-free ω-words generated by binary morphisms

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-1-4612-3352-7_20openalex-snapshot
Some Combinatorial Properties of Factorial Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_11openalex-snapshot
Regularity and Finiteness Conditions
inferred← citeshttps://doi.org/10.1007/bf01200033openalex-snapshot
Propri�t�s de permutabilit� avec certaines restrictions
inferred← citeshttps://doi.org/10.1007/bf01766292openalex-snapshot
On fixed-point-free permutation properties in groups and semigroups
inferred← citeshttps://doi.org/10.1007/bfb0028971openalex-snapshot
Properties of infinite words : Recent results
inferred← citeshttps://doi.org/10.1016/0021-8693(91)90064-fopenalex-snapshot
A finiteness condition for semigroups generalizing a theorem of Hotzel
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00077-1openalex-snapshot
On a combinatorial property of Sturmian words
inferred← citeshttps://doi.org/10.1051/ita/1990240302051openalex-snapshot
A combinatorial theorem on $p$-power-free words and an application to semigroups
inferred← citeshttps://doi.org/10.1515/integ.2009.010openalex-snapshot
Symmetric Numerical Semigroups Generated by Fibonacci and Lucas Triples
inferred← citeshttps://doi.org/10.4153/cmb-1991-006-4openalex-snapshot
A Characterization of the Quadratic Irrationals
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.