Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers

MaRDI QIDQ6383093zbMATH OpenFDO

Authors James D. Currie, L. A. S. Mól, Narad Rampersad, Jeffrey Shallit

Publication date 15 November 2021

Has companion code repository https://github.com/lgmol/Additive-Powers-Decision-Algorithm

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: We construct an infinite binary word with critical exponent 3 that avoids abelian 4-powers. Our method gives an algorithm to determine if certain types of morphic sequences avoid additive powers. We also show that there are $Omega(1.172^n)$ binary words of length $n$ that avoid abelian 4-powers, which improves on previous estimates.

This page was built for publication: Extending Dekking's construction of an infinite binary word avoiding abelian $4$-powers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6383093)