On the public citation graph

There Exist Binary Circular $5/2^+$ Power Free Words of Every Length

https://doi.org/10.37236/1763
0 signed · 25 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/3-540-45005-x_28openalex-snapshot
Circular Words Avoiding Patterns
inferredcites →https://doi.org/10.1070/sm1984v047n02abeh002647openalex-snapshot
BLOCKING SETS OF TERMS
inferredcites →https://doi.org/10.1090/s0002-9947-1980-0576867-5openalex-snapshot
Binary Sequences which Contain no BBb
inferredcites →https://doi.org/10.2307/2371431openalex-snapshot
Symbolic Dynamics II. Sturmian Trajectories
inferredcites →https://doi.org/10.37236/1671openalex-snapshot
There Are Ternary Circular Square-Free Words of Length $n$ for $n\ge 18$

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-642-38771-5_34openalex-snapshot
Repetition Avoidance in Circular Factors
inferred← citeshttps://doi.org/10.1016/j.aam.2020.102095openalex-snapshot
Avoiding abelian powers cyclically
inferred← citeshttps://doi.org/10.1016/j.dam.2009.02.010openalex-snapshot
There are k -uniform cubefree binary morphisms for all k≥0
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.07.003openalex-snapshot
Bounds on the game transversal number in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103242openalex-snapshot
On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness
inferred← citeshttps://doi.org/10.1016/j.jcta.2022.105598openalex-snapshot
Fractional meanings of nonrepetitiveness
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.039openalex-snapshot
Growth of repetition-free words—a review
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.03.001openalex-snapshot
Infinite ternary square-free words concatenated from permutations of a single word
inferred← citeshttps://doi.org/10.1051/ita/2011122openalex-snapshot
Repetition thresholds for subdivided graphs and trees
inferred← citeshttps://doi.org/10.1051/ita/2018008openalex-snapshot
Circular critical exponents for Thue–Morse factors
inferred← citeshttps://doi.org/10.1051/ita/2020006openalex-snapshot
The weak circular repetition threshold over large alphabets
inferred← citeshttps://doi.org/10.12775/tmna.2016.021openalex-snapshot
Indices of fixed points not accumulated by periodic points
inferred← citeshttps://doi.org/10.36045/bbms/1133793340openalex-snapshot
Attainable lengths for circular binary words avoiding $k$ powers
inferred← citeshttps://doi.org/10.37236/2365openalex-snapshot
Repetition Threshold for Circular Words
inferred← citeshttps://doi.org/10.37236/3605openalex-snapshot
Square-Free Words with Square-Free Self-Shuffles
inferred← citeshttps://doi.org/10.37236/6793openalex-snapshot
On Repetition Thresholds of Caterpillars and Trees of Bounded Degree
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.486openalex-snapshot
Cubefree words with many squares
inferred← citeshttps://doi.org/10.48550/arxiv.1702.01058openalex-snapshot
On repetition thresholds of caterpillars and trees of bounded degree
inferred← citeshttps://doi.org/10.48550/arxiv.1808.02529openalex-snapshot
Circular critical exponents for Thue-Morse factors
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.