TOPICS
Search

Additive Power


An additive power of exponent k>=2 is a word over an integer alphabet that is the concatenation of k nonempty blocks having equal lengths and equal sums of their letters (Pirillo and Varricchio 1994). Exponents 2 and 3 give additive squares and additive cubes, respectively. For example, 1423 is an additive square, since 14 and 23 have the same length and sum, although it is not an Abelian square. A finite or infinite word avoids additive kth powers if none of its finite consecutive blocks is such a power.

Shallit (2026) constructed an infinite word avoiding additive squares on an alphabet of six positive integers. This refutes the conjecture that every bounded sequence of positive integers contains an additive square (Brown and Freedman 1987). The alphabet can be taken as

 {1,U+1,U+2,U+L+1,U+L^2+1,(H+2)U+1},

where D=2^(58), H=2D+1, L=285^(11), and U=L^3+1. The minimum possible alphabet size is therefore 4, 5, or 6. Shallit (2026) credits GPT-6.2 Astra with the accompanying Lean formalization.

For additive cubes, Cassaigne et al. (2014) constructed an infinite avoiding word over {0,1,3,4}. It is the fixed point beginning with 0 of the word morphism phi given by 0|->03, 1|->43, 3|->1, and 4|->01. Jamet and Rosenfeld (2026) report that applying the word morphism tau with 0|->21, 1|->100, 3|->3, and 4|->23 gives an additive-cube-free word over {0,1,2,3}. Their computer-assisted argument reduces avoidance to finite graph reachability using numerical spectral bounds. They also obtain avoidance over the three-letter alphabets {0,1,4} and {0,2,5}. Jamet and Rosenfeld (2026) credit ChatGPT with suggesting the first coding word morphism, which they then analyzed.


See also

Abelian Square, Cubefree Word, Squarefree Word, Word

Explore with Wolfram|Alpha

References

Brown, T. C. and Freedman, A. R. "Arithmetic Progressions in Lacunary Sets." Rocky Mountain J. Math. 17, 587-596, 1987. https://doi.org/10.1216/RMJ-1987-17-3-587.Cassaigne, J.; Currie, J. D.; Schaeffer, L.; and Shallit, J. "Avoiding Three Consecutive Blocks of the Same Size and Same Sum." J. ACM 61, Art. 10, 2014. https://doi.org/10.1145/2590775.Jamet, D. and Rosenfeld, M. "Additive Cubes Are Avoidable over {0,1,2,3}, {0,1,4} and {0,2,5}." 13 Nov 2026. https://arxiv.org/abs/2611.17999v1.Pirillo, G. and Varricchio, S. "On Uniformly Repetitive Semigroups." Semigroup Forum 49, 125-129, 1994. https://doi.org/10.1007/BF02573477.Shallit, J. "An Additive-Square-Free Word over an Alphabet of Size 6." 18 Nov 2026. https://arxiv.org/abs/2611.24441v1.

Cite this as:

Weisstein, Eric W. "Additive Power." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/AdditivePower.html

Subject classifications