On the public citation graph
How Many Squares Must a Binary Sequence Contain?
0 signed · 68 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/bf02944986openalex-snapshot
Embedding the dual ofΠ ∞ in the lattice of equational classes of semigroups
inferredcites →https://doi.org/10.1016/0097-3165(74)90041-7openalex-snapshot
On nonrepetitive sequences
inferredcites →https://doi.org/10.1016/s0092-8240(89)80087-4openalex-snapshot
The multiple codes of nucleotide sequences
inferredcites →https://doi.org/10.1038/314067a0openalex-snapshot
Hypervariable ‘minisatellite’ regions in human DNA
inferredcites →https://doi.org/10.1038/316076a0openalex-snapshot
Individual-specific ‘fingerprints’ of human DNA
inferredcites →https://doi.org/10.1051/ita/1983170100131openalex-snapshot
On the separating power of EOL systems
inferredcites →https://doi.org/10.1070/im1968v002n01abeh000637openalex-snapshot
INFINITE PERIODIC GROUPS. I
inferredcites →https://doi.org/10.1080/00029890.1993.11990489openalex-snapshot
Open Problems in Pattern Avoidance
inferredcites →https://doi.org/10.1215/s0012-7094-44-01101-4openalex-snapshot
Unending chess, symbolic dynamics and a problem in semigroups
inferredcites →https://doi.org/10.4153/cjm-1977-067-7openalex-snapshot
A Transformation with Simple Spectrum which is not Rank One
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcta.1997.2843openalex-snapshot
How Many Squares Can a String Contain?
inferred← citeshttps://doi.org/10.1007/11925903_14openalex-snapshot
Hairpin Structures Defined by DNA Trajectories
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_31openalex-snapshot
On maximal repetitions in words
inferred← citeshttps://doi.org/10.1007/3-540-63220-4_51openalex-snapshot
On weak circular squares in binary words
inferred← citeshttps://doi.org/10.1007/978-0-387-35706-5_24openalex-snapshot
New Games Related to Old and New Sequences
inferred← citeshttps://doi.org/10.1007/978-3-030-28796-2_21openalex-snapshot
New Results on Pseudosquare Avoidance
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_29openalex-snapshot
Clusters of Repetition Roots: Single Chains
inferred← citeshttps://doi.org/10.1007/978-3-031-13257-5_4openalex-snapshot
Clusters of Repetition Roots Forming Prefix Chains
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_6openalex-snapshot
Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free 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-540-28629-5_64openalex-snapshot
A Generalization of Repetition Threshold
inferred← citeshttps://doi.org/10.1007/978-3-540-78291-9_2openalex-snapshot
Open Problems on Partial Words
inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_1openalex-snapshot
Hunting Redundancies in Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-31653-1_36openalex-snapshot
Squares in Binary Partial Words
inferred← citeshttps://doi.org/10.1007/s00026-023-00651-5openalex-snapshot
Long Twins in Random Words
inferred← citeshttps://doi.org/10.1007/s00224-007-9086-6openalex-snapshot
Hairpin Structures Defined by DNA Trajectories
inferred← citeshttps://doi.org/10.1007/s00453-009-9362-8openalex-snapshot
Spiraling and Folding: The Word View
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.05.005openalex-snapshot
Cyclically repetition-free words on small alphabets
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.01.004openalex-snapshot
Infinite binary words containing repetitions of odd period
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.106021openalex-snapshot
New bounds on antipowers in words
inferred← citeshttps://doi.org/10.1016/j.jda.2013.03.001openalex-snapshot
Infinite words containing the minimal number of repetitions
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.01.005openalex-snapshot
Avoiding large squares in infinite binary words
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.016openalex-snapshot
A generalization of repetition threshold
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.11.006openalex-snapshot
A generalization of Thue freeness for partial words
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.009openalex-snapshot
Avoiding large squares in partial words
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.032openalex-snapshot
On the number of frames in binary words
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.011openalex-snapshot
Fewest repetitions versus maximal-exponent powers in infinite binary words
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.029openalex-snapshot
Avoiding 2-binomial squares and cubes
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.2016.12.022openalex-snapshot
On the aperiodic avoidability of binary patterns with variables and reversals
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.029openalex-snapshot
Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.023openalex-snapshot
Squarefree words with interior disposable factors
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.10.028openalex-snapshot
On shuffled-square-free words
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00121-9openalex-snapshot
Simple and flexible detection of contiguous repeats using a suffix tree
inferred← citeshttps://doi.org/10.1051/ita/2011109openalex-snapshot
Fewest repetitions in infinite binary words
inferred← citeshttps://doi.org/10.1051/ita/2014017openalex-snapshot
Finite repetition threshold for large alphabets
inferred← citeshttps://doi.org/10.1051/ita/2021001openalex-snapshot
The simplest binary word with only three squares
inferred← citeshttps://doi.org/10.1051/ita:2006020openalex-snapshot
A generator of morphisms for infinite words
inferred← citeshttps://doi.org/10.1090/mcom/3085openalex-snapshot
Avoidability of long 𝑘-abelian repetitions
inferred← citeshttps://doi.org/10.3103/s002713221601006xopenalex-snapshot
Square-free words with one possible mismatch
inferred← citeshttps://doi.org/10.3103/s0027132218030026openalex-snapshot
Existence of Words over Tree-Letter Alphabet not Containing Squares with Replacement Errors
inferred← citeshttps://doi.org/10.37236/1598openalex-snapshot
Aviezri Fraenkel's Work in Number Theory
inferred← citeshttps://doi.org/10.37236/1705openalex-snapshot
How Many Square Occurrences Must a Binary Sequence Contain?
inferred← citeshttps://doi.org/10.37236/4851openalex-snapshot
Nondeterministic Automatic Complexity of Overlap-Free and Almost Square-Free Words
inferred← citeshttps://doi.org/10.37236/493openalex-snapshot
The Number of Positions Starting a Square in Binary Words
inferred← citeshttps://doi.org/10.4204/eptcs.252.10openalex-snapshot
Constructing Words with High Distinct Square Densities
inferred← citeshttps://doi.org/10.4204/eptcs.63.7openalex-snapshot
Finite-Repetition threshold for infinite ternary words
inferred← citeshttps://doi.org/10.4213/dm1325openalex-snapshot
О существовании сколь угодно длинных слов, не содержащих квадратов с одной возможной ошибкой замещения
inferred← citeshttps://doi.org/10.4213/dm1473openalex-snapshot
О существовании слов над двухбуквенным алфавитом, не содержащих квадратов с ошибками замещения
inferred← citeshttps://doi.org/10.48550/arxiv.1207.5723openalex-snapshot
Fewest repetitions in infinite binary words
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02581openalex-snapshot
Avoidability of long $k$-abelian repetitions
inferred← citeshttps://doi.org/10.48550/arxiv.1802.04481openalex-snapshot
Solved and unsolved problems about abelian squares
inferred← citeshttps://doi.org/10.48550/arxiv.math/0302303openalex-snapshot
Cubefree binary words avoiding long squares
inferred← citeshttps://doi.org/10.48550/arxiv.math/0310144openalex-snapshot
A Generalization of Repetition Threshold
inferred← citeshttps://doi.org/10.70675/34d6b04az89d0z4c8fz9bbazc0e8448c0213openalex-snapshot
Avoidability of Abelian Repetitions in 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.