Abstract
We will prove that the word aibjak is periodicity forcing if j GREATER-THAN OR EQUAL TO 3 and i + k GREATER-THAN OR EQUAL TO 3, where i and k are positive integers. Also we will give examples showing that both bounds are optimal.
We will prove that the word aibjak is periodicity forcing if j GREATER-THAN OR EQUAL TO 3 and i + k GREATER-THAN OR EQUAL TO 3, where i and k are positive integers. Also we will give examples showing that both bounds are optimal.