On the public citation graph
On Abelian repetition threshold
0 signed · 41 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/3-540-55719-9_62openalex-snapshot
Abelian squares are avoidable on 4 letters
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/0304-3975(88)90009-6openalex-snapshot
Uniformly growing k-th power-free homomorphisms
inferredcites →https://doi.org/10.1016/j.tcs.2004.02.005openalex-snapshot
The number of binary words avoiding abelian fourth powers grows exponentially
inferredcites →https://doi.org/10.1016/j.tcs.2007.06.001openalex-snapshot
On Dejean’s conjecture over large alphabets
inferredcites →https://doi.org/10.1016/j.tcs.2009.05.027openalex-snapshot
A powerful abelian square-free substitution over 4 letters
inferredcites →https://doi.org/10.1016/j.tcs.2010.05.017openalex-snapshot
Growth rates of complexity of power-free languages
inferredcites →https://doi.org/10.1016/j.tcs.2010.06.020openalex-snapshot
Last cases of Dejean’s conjecture
inferredcites →https://doi.org/10.1016/s0020-0190(98)00104-5openalex-snapshot
Automata and forbidden words
inferredcites →https://doi.org/10.1016/s0166-218x(97)88002-xopenalex-snapshot
On the number of Abelian square-free words on four letters
inferredcites →https://doi.org/10.1051/ita:2008021openalex-snapshot
Comparing Complexity Functions of a Language and Its Extendable Part
inferredcites →https://doi.org/10.1090/s0025-5718-2010-02407-xopenalex-snapshot
A proof of Dejean’s conjecture
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4011686openalex-extracted
On Minimal Critical Exponent of Balanced Sequences
inferred← citeshttps://doi.org/10.1007/978-3-030-28796-2_11openalex-snapshot
The Undirected Repetition Threshold
inferred← citeshttps://doi.org/10.1007/978-3-030-81508-0_27openalex-snapshot
Branching Frequency and Markov Entropy of Repetition-Free Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-09574-0_19openalex-snapshot
Abelian Repetition Threshold Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_3openalex-snapshot
Growth Properties of Power-Free Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_21openalex-snapshot
Abelian Repetitions in Sturmian Words
inferred← citeshttps://doi.org/10.1007/s00224-015-9629-1openalex-snapshot
Weak Abelian Periodicity of Infinite Words
inferred← citeshttps://doi.org/10.1007/s00224-024-10187-7openalex-snapshot
Non-Constructive Upper Bounds for Repetition Thresholds
inferred← citeshttps://doi.org/10.1016/j.aam.2020.102095openalex-snapshot
Avoiding abelian powers cyclically
inferred← citeshttps://doi.org/10.1016/j.cosrev.2012.09.001openalex-snapshot
Growth properties of power-free languages
inferred← citeshttps://doi.org/10.1016/j.cosrev.2022.100532openalex-snapshot
Abelian combinatorics on words: A survey
inferred← citeshttps://doi.org/10.1016/j.jnt.2020.04.007openalex-snapshot
Abelian periods of factors of Sturmian words
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.039openalex-snapshot
Abelian powers and repetitions in Sturmian words
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.010openalex-snapshot
The undirected repetition threshold and undirected pattern avoidance
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.021openalex-snapshot
On minimal critical exponent of balanced sequences
inferred← citeshttps://doi.org/10.1051/ita/2013034openalex-snapshot
Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
inferred← citeshttps://doi.org/10.1051/ita/2024011openalex-snapshot
A Small Morphism for which the Fixed Point has an Abelian Critical Exponent Less than 2
inferred← citeshttps://doi.org/10.1137/23m1558513openalex-snapshot
Extending Dekking’s Construction of an Infinite Binary Word Avoiding Abelian 4-Powers
inferred← citeshttps://doi.org/10.1142/s0129054112500190openalex-snapshot
IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS
inferred← citeshttps://doi.org/10.1177/0959651815601276openalex-snapshot
Fault diagnosis for the landing phase of the aircraft based on an adaptive kernel principal component analysis algorithm
inferred← citeshttps://doi.org/10.3233/978-1-61499-295-0-123openalex-snapshot
Online Privacy – Towards Informational Self-Determination on the Internet
inferred← citeshttps://doi.org/10.37236/2365openalex-snapshot
Repetition Threshold for Circular Words
inferred← citeshttps://doi.org/10.37236/7985openalex-snapshot
Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture
inferred← citeshttps://doi.org/10.46298/dmtcs.10063openalex-snapshot
Antisquares and Critical Exponents
inferred← citeshttps://doi.org/10.48550/arxiv.1010.5456openalex-snapshot
Combinatorial Characterization of Formal Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1307openalex-snapshot
Identifying all abelian periods of a string in quadratic time and relevant problems
inferred← citeshttps://doi.org/10.48550/arxiv.1209.6013openalex-snapshot
Abelian Repetitions in Sturmian 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.