James Currie, Pascal Ochem, Narad Rampersad, Jeffrey Shallit
Published 2022-09-20Version 1
The complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. We study infinite binary words $\bf w$ that avoid sufficiently large complementary factors; that is, if $x$ is a factor of $\bf w$ then $\overline{x}$ is not a factor of $\bf w$. In particular, we classify such words according to their critical exponents.
A proof that HT is more likely to outnumber HH than vice versa in a sequence of n coin flips
Critical exponent of binary words with few distinct palindromes
Antisquares and Critical Exponents
![QR code for arXiv:2209.09598 [math.CO]](http://oss.arxitics.com/images/favicon.svg)