On the public citation graph
On the Entropy and Letter Frequencies of Ternary Square-Free Words
0 signed · 48 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.1002/(sici)1098-2418(199709)11:2<151::aid-rsa4>3.0.co;2-ropenalex-snapshot
Probabilistic analysis of column-convex and directed diagonally-convex animals
inferredcites →https://doi.org/10.1007/bfb0029978openalex-snapshot
Minimal letter frequency in n-th power-free binary words
inferredcites →https://doi.org/10.1007/bfb0055819openalex-snapshot
On repetition-free binary words of minimal density
inferredcites →https://doi.org/10.1016/0304-3975(82)90023-8openalex-snapshot
Sharp characterizations of squarefree morphisms
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/0304-3975(89)90071-6openalex-snapshot
Growth problems for avoidable words
inferredcites →https://doi.org/10.1016/b978-0-12-198820-3.50009-7openalex-snapshot
TESTS SUR LES MORPHISMES FAIBLEMENT SANS CARRE
inferredcites →https://doi.org/10.1016/b978-0-12-198820-3.50011-5openalex-snapshot
ON THE STRUCTURE AND EXTENDIBILITY OF SQUARE-FREE WORDS
inferredcites →https://doi.org/10.1016/j.jcta.2003.12.004openalex-snapshot
Polynomial versus exponential growth in repetition-free binary words
inferredcites →https://doi.org/10.1016/s0012-365x(99)00262-9openalex-snapshot
Indicators of solvability for lattice models
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.1016/s0895-7177(97)00196-9openalex-snapshot
The entropy of square-free words
inferredcites →https://doi.org/10.1017/cbo9781107326019openalex-snapshot
Algebraic Combinatorics on Words
inferredcites →https://doi.org/10.1080/00029890.1993.11990489openalex-snapshot
Open Problems in Pattern Avoidance
inferredcites →https://doi.org/10.1080/10236199908808197openalex-snapshot
The Goulden—Jackson cluster method: extensions, applications and implementations
inferredcites →https://doi.org/10.1088/0305-4470/31/30/007openalex-snapshot
Random tilings: concepts and examples
inferredcites →https://doi.org/10.1093/acprof:oso/9780199666577.001.0001openalex-snapshot
The Statistical Mechanics of Interacting Walks, Polygons, Animals and Vesicles
inferredcites →https://doi.org/10.1093/oso/9780198505617.001.0001openalex-snapshot
The Statistical Mechanics of Interacting Walks, Polygons, Animals and Vesicles
inferredcites →https://doi.org/10.1093/qmath/34.2.145openalex-snapshot
NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
inferredcites →https://doi.org/10.1112/blms/16.3.315openalex-snapshot
COMBINATORICS ON WORDS (Encyclopedia of Mathematics and Its Applications, 17)
inferredcites →https://doi.org/10.2140/pjm.1979.85.261openalex-snapshot
Avoidable patterns in strings of symbols
inferredcites →https://doi.org/10.37236/1671openalex-snapshot
There Are Ternary Circular Square-Free Words of Length $n$ for $n\ge 18$
inferredcites →https://doi.org/10.48550/arxiv.math/0105245openalex-snapshot
Improved bounds on the number of ternary square-free words
inferredcites →https://doi.org/10.48550/arxiv.math/9809135openalex-snapshot
There are More Than 2**(n/17) n-Letter Ternary Square-Free Words
inferredcites →https://doi.org/10.5860/choice.33-2176openalex-snapshot
The encyclopedia of integer sequences
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-540-79709-8_30openalex-snapshot
Combinatorial Complexity of Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_3openalex-snapshot
Growth Properties of Power-Free Languages
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.endm.2007.01.068openalex-snapshot
Dejean's conjecture and letter frequency
inferred← citeshttps://doi.org/10.1016/j.indag.2022.04.004openalex-snapshot
Mixing properties and entropy bounds of a family of Pisot random substitutions
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.2007.03.027openalex-snapshot
Letter frequency in infinite repetition-free words
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.017openalex-snapshot
Growth rates of complexity of power-free languages
inferred← citeshttps://doi.org/10.1051/ita:2008013openalex-snapshot
Dejean's conjecture and letter frequency
inferred← citeshttps://doi.org/10.1134/s1990478907040084openalex-snapshot
On the number of repetition-free words
inferred← citeshttps://doi.org/10.1142/s0218196717500242openalex-snapshot
A family of formulas with reversal of high avoidability index
inferred← citeshttps://doi.org/10.3103/s1066369x09090096openalex-snapshot
Growth rates of power-free languages
inferred← citeshttps://doi.org/10.3390/e10040590openalex-snapshot
On the Entropy and Letter Frequencies of Powerfree Words
inferred← citeshttps://doi.org/10.48550/arxiv.1010.5456openalex-snapshot
Combinatorial Characterization of Formal Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1606.00835openalex-snapshot
An Improved Lower Bound for $n$-Brinkhuis $k$-Triples
inferred← citeshttps://doi.org/10.48550/arxiv.2001.00578openalex-snapshot
Errata and Addenda to Mathematical Constants
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.