On the public citation graph
Avoidability of long π-abelian repetitions
0 signed Β· 26 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.1007/978-3-642-65574-6_11openalex-snapshot
Some Unsolved Problems
inferredcites βhttps://doi.org/10.1016/0097-3165(74)90041-7openalex-snapshot
On nonrepetitive sequences
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/j.jcta.2013.08.008openalex-snapshot
On a generalization of Abelian equivalence and complexity of infinite words
inferredcites βhttps://doi.org/10.1016/j.tcs.2015.07.026openalex-snapshot
On some generalizations of abelian power avoidability
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.1142/s0218196793000123openalex-snapshot
ON ABELIAN POWER-FREE MORPHISMS
inferredcites βhttps://doi.org/10.37236/1196openalex-snapshot
How Many Squares Must a Binary Sequence Contain?
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-28796-2_2openalex-snapshot
Abelian Properties of Words
inferredβ citeshttps://doi.org/10.1007/978-3-319-69152-7_5openalex-snapshot
Avoiding or Limiting Regularities in Words
inferredβ citeshttps://doi.org/10.1007/978-3-319-98355-4_4openalex-snapshot
Regularity of k-Abelian Equivalence Classes of Fixed Cardinality
inferredβ citeshttps://doi.org/10.1007/978-3-662-53132-7_7openalex-snapshot
k-Abelian Equivalence and Rationality
inferredβ citeshttps://doi.org/10.1016/j.cosrev.2022.100532openalex-snapshot
Abelian combinatorics on words: A survey
inferredβ citeshttps://doi.org/10.1016/j.tcs.2015.07.026openalex-snapshot
On some generalizations of abelian power avoidability
inferredβ citeshttps://doi.org/10.1016/j.tcs.2020.01.023openalex-snapshot
A compactness property of the k-abelian monoids
inferredβ citeshttps://doi.org/10.1137/17m1149377openalex-snapshot
Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$
inferredβ citeshttps://doi.org/10.21941/kcss/2019/3openalex-snapshot
Theoretical and Practical Aspects Related to the Avoidability of Patterns in Words
inferredβ citeshttps://doi.org/10.3233/fi-2017-1553openalex-snapshot
k-Abelian Equivalence and Rationality
inferredβ citeshttps://doi.org/10.4230/lipics.mfcs.2016.81openalex-snapshot
Avoiding two consecutive blocks of same size and same sum over $\mathbb{Z}^2$
inferredβ citeshttps://doi.org/10.48550/arxiv.1906.00715openalex-snapshot
On Modelling the Avoidability of Patterns as CSP
inferredβ citeshttps://doi.org/10.70675/34d6b04az89d0z4c8fz9bbazc0e8448c0213openalex-snapshot
Avoidability of Abelian Repetitions in Words
inferredβ citeshttps://doi.org/10.70675/71ac03bdz338fz4b4bz8f14z395588374235openalex-snapshot
ΓvitabilitΓ© de puissances additives en combinatoire des mots
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.