A Lebesgue variant of the additive square problem

Abstract

The additive square problem is a relatively famous open problem in the area of combinatorics on words: Does there exist an infinite word over a finite alphabet, such that no two consecutive blocks of the same length have the same sum? In this note we solve a Lebesgue integral variant of the problem. The proof is based on Lebesgue's density theorem.