On the public citation graph

How Many Square Occurrences Must a Binary Sequence Contain?

https://doi.org/10.37236/1705
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.1006/jcta.1997.2843openalex-snapshot
How Many Squares Can a String Contain?
inferredcites →https://doi.org/10.1007/978-3-642-59136-5_6openalex-snapshot
Combinatorics of Words
inferredcites →https://doi.org/10.1016/0012-365x(92)90146-7openalex-snapshot
Ordered h-hypertrees
inferredcites →https://doi.org/10.1016/0020-0190(81)90024-7openalex-snapshot
An optimal algorithm for computing the repetitions in a word
inferredcites →https://doi.org/10.1016/0095-8956(86)90044-4openalex-snapshot
Hypertrees and Bonferroni inequalities
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(94)90134-1openalex-snapshot
Minimum spanning hypertrees
inferredcites →https://doi.org/10.1016/s0304-3975(98)00257-6openalex-snapshot
On repetition-free binary words of minimal density
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-319-09698-8_17openalex-snapshot
On k-Abelian Palindromic Rich and Poor 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-642-31653-1_36openalex-snapshot
Squares in Binary Partial Words
inferred← citeshttps://doi.org/10.1016/j.ic.2018.04.001openalex-snapshot
On k-abelian palindromes
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.2011.05.032openalex-snapshot
On the number of frames in binary words
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.007openalex-snapshot
On the average number of regularities in a word
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.023openalex-snapshot
Squares in partial words
inferred← citeshttps://doi.org/10.3390/e10040590openalex-snapshot
On the Entropy and Letter Frequencies of Powerfree 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.48550/arxiv.1802.04481openalex-snapshot
Solved and unsolved problems about abelian squares
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.