跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.24441 · v1

An additive-square-free word over an alphabet of size 6

首次提交 2026-11-18 21:55
版本更新 2026-11-18 21:55
雷达观测 2026-11-19 15:04
arXiv ↗PDF ↗

摘要

An additive square over N\mathbb{N} is two consecutive nonempty blocks of the same length and same sum. For example, 1423 is an additive square, since 14 and 23 both have length 2 and sum 5. Solving a problem that has been open for more than 50 years, we give an example of an infinite word over a 6-letter subset of N that avoids additive squares.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-18 21:55 · 最新观测版本

An additive-square-free word over an alphabet of size 6

An additive square over N\mathbb{N} is two consecutive nonempty blocks of the same length and same sum. For example, 1423 is an additive square, since 14 and 23 both have length 2 and sum 5. Solving a problem that has been open for more than 50 years, we give an example of an infinite word over a 6-letter subset of N that avoids additive squares.

查看此版本解读 →查看此版本原文 ↗