On the public citation graph

On the Repetition Threshold for Large Alphabets

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.
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/978-3-540-28629-5_64openalex-snapshot
A Generalization of Repetition Threshold
inferredcites →https://doi.org/10.1016/0097-3165(72)90011-8openalex-snapshot
Sur un théorème de Thue
inferredcites →https://doi.org/10.1016/0166-218x(84)90006-4openalex-snapshot
A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
inferredcites →https://doi.org/10.1016/0304-3975(88)90009-6openalex-snapshot
Uniformly growing k-th power-free homomorphisms
inferredcites →https://doi.org/10.1016/0304-3975(92)90264-gopenalex-snapshot
Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 letters
inferredcites →https://doi.org/10.1016/j.ejc.2005.11.005openalex-snapshot
Dejean’s conjecture and Sturmian words
inferredcites →https://doi.org/10.1016/j.jcta.2003.12.004openalex-snapshot
Polynomial versus exponential growth in repetition-free binary words
inferredcites →https://doi.org/10.1051/ita/1992260301991openalex-snapshot
Repetitions in the Fibonacci infinite word
inferredcites →https://doi.org/10.1142/9789812562494_0059openalex-snapshot
COMBINATORICS ON WORDS – A TUTORIAL
inferredcites →https://doi.org/10.1142/s0129054104002443openalex-snapshot
SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
inferredcites →https://doi.org/10.1142/s0218196791000286openalex-snapshot
MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT

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-540-73208-2_27openalex-snapshot
Avoiding Approximate Squares
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_30openalex-snapshot
Combinatorial Complexity of Regular Languages
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.068openalex-snapshot
Dejean's conjecture and letter frequency
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.03.027openalex-snapshot
Letter frequency in infinite repetition-free words
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.037openalex-snapshot
Every real number greater than 1 is a critical exponent
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.001openalex-snapshot
On Dejean’s conjecture over large alphabets
inferred← citeshttps://doi.org/10.1051/ita/2010015openalex-snapshot
On the D0L Repetition Threshold
inferred← citeshttps://doi.org/10.3390/books978-3-03943-612-5openalex-snapshot
Evolutionary Algorithms in Intelligent Systems
inferred← citeshttps://doi.org/10.3390/math7040321openalex-snapshot
The Existence and Global Exponential Stability of Almost Periodic Solutions for Neutral-Type CNNs on Time Scales
inferred← citeshttps://doi.org/10.3390/math7050423openalex-snapshot
Memes Evolution in a Memetic Variant of Particle Swarm Optimization
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.