On the public citation graph
Thue-like Sequences and Rainbow Arithmetic Progressions
0 signed · 35 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-1-4471-0551-0_1openalex-snapshot
The Ubiquitous Prouhet-Thue-Morse Sequence
inferredcites →https://doi.org/10.1007/bfb0081890openalex-snapshot
Substitution Dynamical Systems-Spectral Analysis
inferredcites →https://doi.org/10.1016/0097-3165(79)90044-xopenalex-snapshot
Strongly non-repetitive sequences and progression-free sets
inferredcites →https://doi.org/10.1016/s0012-365x(02)00879-8openalex-snapshot
Non-repetitive colorings of infinite sets
inferredcites →https://doi.org/10.1023/a:1015241900975openalex-snapshot
Multiplicative properties of the Thue-Morse sequence
inferredcites →https://doi.org/10.1080/00029890.1993.11990489openalex-snapshot
Open Problems in Pattern Avoidance
inferredcites →https://doi.org/10.1090/s0002-9939-1964-0158386-xopenalex-snapshot
A Characterization of the Morse Minimal Set
inferredcites →https://doi.org/10.2140/pjm.1979.85.261openalex-snapshot
Avoidable patterns in strings of symbols
inferredcites →https://doi.org/10.2140/pjm.1980.89.137openalex-snapshot
Square-free and cube-free colorings of the ordinals
inferredcites →https://doi.org/10.2307/2370306openalex-snapshot
A One-to-One Representation of Geodesics on a Surface of Negative Curvature
inferredcites →https://doi.org/10.4153/cmb-1992-023-6openalex-snapshot
Words without Near-Repetitions
inferredcites →https://doi.org/10.46298/dmtcs.3415openalex-snapshot
Nonrepetitive colorings of graphs
inferredcites →https://doi.org/10.5281/zenodo.7554230openalex-snapshot
An Application of van der Waerden's Theorem in Additive Number Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22430openalex-snapshot
Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor
inferred← citeshttps://doi.org/10.1002/rsa.20354openalex-snapshot
Highly nonrepetitive sequences: Winning strategies from the local lemma
inferred← citeshttps://doi.org/10.1007/1-4020-2547-5_4openalex-snapshot
Special arithmetic functions connected with the divisors, or with the digits of a number
inferred← citeshttps://doi.org/10.1007/s00493-015-3070-6openalex-snapshot
Nonrepetitive colouring via entropy compression
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.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.tcs.2005.01.004openalex-snapshot
Pattern avoidance: themes and variations
inferred← citeshttps://doi.org/10.1155/2007/74639openalex-snapshot
Nonrepetitive Colorings of GraphsA Survey
inferred← citeshttps://doi.org/10.19086/aic.12100openalex-snapshot
Planar graphs have bounded nonrepetitive chromatic number
inferred← citeshttps://doi.org/10.37236/3153openalex-snapshot
Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours
inferred← citeshttps://doi.org/10.48550/arxiv.1010.5772openalex-snapshot
Highly nonrepetitive sequences: winning strategies from the local lemma
inferred← citeshttps://doi.org/10.48550/arxiv.math/0307365openalex-snapshot
A note on non-repetitive colourings of planar graphs
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.