Palindromic length of infinite aperiodic words

IF 0.9 3区数学 Q1 MATHEMATICS

European Journal of Combinatorics Pub Date : 2025-09-08 DOI:10.1016/j.ejc.2025.104237

Josef Rukavicka

引用次数: 0

Abstract

The palindromic length of the finite word

v

is equal to the minimal number of palindromes whose concatenation is equal to

v

. It was conjectured in 2013 that for every infinite aperiodic word

x

, the palindromic length of its factors is not bounded. We prove this conjecture to be true.

查看原文本刊更多论文

无限非周期性单词的回文长度

有限单词v的回文长度等于串接等于v的回文的最小个数。2013年曾推测，对于每一个无限的非周期单词x，其因子的回文长度都是无界的。我们证明这个猜想是正确的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

European Journal of Combinatorics 数学-数学

CiteScore

2.10

自引率

10.00%

发文量

124

审稿时长

4-8 weeks

期刊介绍： The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.