Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.21200 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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.