pith. sign in

arxiv: math/0304095 · v1 · submitted 2003-04-07 · 🧮 math.CO · cs.DM

Polynomial versus Exponential Growth in Repetition-Free Binary Words

classification 🧮 math.CO cs.DM
keywords binarywordslengthavoidexponentialexponentiallygrowsgrowth
0
0 comments X
read the original abstract

It is known that the number of overlap-free binary words of length n grows polynomially, while the number of cubefree binary words grows exponentially. We show that the dividing line between polynomial and exponential growth is 7/3. More precisely, there are only polynomially many binary words of length n that avoid 7/3-powers, but there are exponentially many binary words of length n that avoid (7/3+)-powers. This answers an open question of Kobayashi from 1986.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.