The number of ternary words avoiding abelian cubes grows exponentially.
Aberkane, Ali, Currie, James D., Rampersad, Narad (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Displaying similar documents to “Symmetric subsets of lattice paths.”
The number of ternary words avoiding abelian cubes grows exponentially.
Van der Waerden's theorem and avoidability in words.
Au, Yu-Hin, Robertson, Aaron, Shallit, Jeffrey (2011)
Integers
Similarity:
Improved bounds on the length of maximal abelian square-free words.
Bullock, Evan M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on antichains of words.
Currie, James D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Further applications of a power series method for pattern avoidance.
Rampersad, Narad (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of positions starting a square in binary words.
Harju, Tero, Kärki, Tomi, Nowotka, Dirk (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
How many square occurrences must a binary sequence contain?
Kucherov, Gregory, Ochem, Pascal, Rao, Michaël (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Two very short proofs of combinatorial identity.
Anglani, Roberto, Barile, Margherita (2005)
Integers
Similarity:
A combinatorial proof of a symmetric -Pfaff-Saalschütz identity.
Guo, Victor J.W., Zeng, Jiang (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Transcendence of numbers with an expansion in a subclass of complexity 2 + 1
Tomi Kärki (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
We divide infinite sequences of subword complexity into four subclasses with respect to left and right special elements and examine the structure of the subclasses with the help of Rauzy graphs. Let ≥ 2 be an integer. If the expansion in base of a number is an Arnoux-Rauzy word, then it belongs to Subclass I and the number is known to be transcendental. We prove the transcendence of numbers with expansions in the subclasses II and III.
Overlap-free symmetric D0L words.
Frid, Anna (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
There are ternary circular square-free words of length for 18.
Currie, James D. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bordered conjugates of words over large alphabets.
Harju, Tero, Nowotka, Dirk (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: