On the public citation graph
Non-Repetitive Tilings
0 signed · 21 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/bf02944986openalex-snapshot
Embedding the dual ofΠ ∞ in the lattice of equational classes of semigroups
inferredcites →https://doi.org/10.2140/pjm.1979.85.261openalex-snapshot
Avoidable patterns in strings of symbols
inferredcites →https://doi.org/10.4153/cjm-1977-067-7openalex-snapshot
A Transformation with Simple Spectrum which is not Rank One
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-3-030-51466-2_23openalex-snapshot
Repetitions in Toeplitz Words and the Thue Threshold
inferred← citeshttps://doi.org/10.1007/s00236-003-0110-2openalex-snapshot
A word on 7 letters which is non-repetitive up to mod 5
inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.013openalex-snapshot
On non-repetitive sequences of arithmetic progressions: The cases k∈{4,5,6,7,8}
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.039openalex-snapshot
Thue type problems for graphs, points, and numbers
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.12.002openalex-snapshot
Nonrepetitive and pattern-free colorings of the plane
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.077openalex-snapshot
Nonrepetitive colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.063openalex-snapshot
Nonrepetitive colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.056openalex-snapshot
On avoding r-repetitions in R2
inferred← citeshttps://doi.org/10.1016/j.neunet.2014.05.001openalex-snapshot
Grid topologies for the self-organizing map
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.01.004openalex-snapshot
Pattern avoidance: themes and variations
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.10.039openalex-snapshot
Words avoiding repetitions in arithmetic progressions
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.006openalex-snapshot
Some further results on squarefree arithmetic progressions in infinite words
inferred← citeshttps://doi.org/10.1155/2007/74639openalex-snapshot
Nonrepetitive Colorings of GraphsA Survey
inferred← citeshttps://doi.org/10.37236/1660openalex-snapshot
Thue-like Sequences and Rainbow Arithmetic Progressions
inferred← citeshttps://doi.org/10.37236/1671openalex-snapshot
There Are Ternary Circular Square-Free Words of Length $n$ for $n\ge 18$
inferred← citeshttps://doi.org/10.48550/arxiv.1812.02067openalex-snapshot
On some problems of Harju concerning squarefree arithmetic progressions in infinite words
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.