Results

**1 - 5**of**5**### unknown title

, 2008

"... For each α> 2 there is an infinite binary word with critical exponent α ..."

### CUBEFREE WORDS WITH MANY SQUARES

, 811

"... Abstract. We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n. 1. ..."

Abstract
- Add to MetaCart

Abstract. We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n. 1.

### Article 13.2.7 On Highly Repetitive and Power Free Words

"... Answering a question of Richomme, Currie and Rampersad proved that 7/3 is the infimum of the real numbers α> 2 such that there exists an infinite binary word that avoids α-powers but is highly 2-repetitive, i.e., contains arbitrarily large squares beginning at every position. In this paper, we prove ..."

Abstract
- Add to MetaCart

Answering a question of Richomme, Currie and Rampersad proved that 7/3 is the infimum of the real numbers α> 2 such that there exists an infinite binary word that avoids α-powers but is highly 2-repetitive, i.e., contains arbitrarily large squares beginning at every position. In this paper, we prove similar statements about β-repetitive words, for some other β’s, over the binary and the ternary alphabets. 1