arXiv math/06036072006-03-26math.CO

Factor versus palindromic complexity of uniformly recurrent infinite words

Peter Baláži, Zuzana Masáková, Edita Pelantová

备注：: 16 pages, submitted to Theoretical Computer Science

英文摘要：

We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n)+P(n+1) \leq ΔC(n) + 2, for all n \in N. For a large class of words it is a better estimate of the palindromic complexity in terms of the factor complexity then the one presented by Allouche et al. We provide several examples of infinite words for which our estimate reaches its upper bound. In particular, we derive an explicit prescription for the palindromic complexity of infinite words coding r-interval exchange transformations. If the permutation πconnected with the transformation is given by π(k)=r+1-k for all k, then there is exactly one palindrome of every even length, and exactly r palindromes of every odd length.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Languages invariant under more symmetries: overlapping factors versus palindromic richness

Factor complexity $\mathcal{C}$ and palindromic complexity $\mathcal{P}$ of infinite words with language closed under reversal are known to be related by the inequality $\mathcal{P}(n) + \mathcal{P}(n+1) \leq 2 + \mathcal{C}(n+1)-\mathcal{C}(n)$ for any $n\in \mathbb{N}$\,. Word for which the equality is attained for any $n$ is usually called rich in palindromes. In this article we study words whose languages are invariant under a finite group $G$ of symmetries. For such words we prove a stronger version of the above inequality. We introduce notion of $G$-palindromic richness and give several …

2012-07-09math.CO

On Words with the Zero Palindromic Defect

We study the set of finite words with zero palindromic defect, i.e., words rich in palindromes. This set is factorial, but not recurrent. We focus on description of pairs of rich words which cannot occur simultaneously as factors of a longer rich word.

2017-08-23math.CO

关于低复杂度词的回文因子数量

On the number of palindromic factors of low complexity words

Dongguk University–Seoul（东国大学首尔校区）；Catholic Kwandong University（天主教关东大学）

本文研究低复杂度无限词中回文因子数量的上界，证明在因子复杂度不超过长度三分之二加一时等式成立，并构造最优性例子及局部准则。

2026-09-16math.COmath.DS

Palindromic Richness

In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are 'rich' in palindromes in the utmost sense. A characteristic property of so-called "rich words" is that all complete returns to any palindromic factor are themselves palindromes. These words encompass the well-known episturmian words, originally introduced by the second author together with X. Droubay and G. Pirillo in 2001. Other examples of rich words have appeared in many different contexts. Here we present the first unified approach to the study of this intriguing family of w…

2008-04-11cs.DMmath.CO

关于模递返词上细胞自动机的研究

On the study of cellular automata on modulo-recurrent words

本文研究了保持稳定性的细胞自动机在Sturmian词上的应用，确定了其组合性质，并证明了词的2-平衡性和交换复杂度函数。

2025-12-19math.CO

Palindromic Length and Reduction of Powers

Given a nonempty finite word $v$, let $PL(v)$ be the palindromic length of $v$; it means the minimal number of palindromes whose concatenation is equal to $v$. Let $v^R$ denote the reversal of $v$. Given a finite or infinite word $y$, let $Fac(y)$ denote the set of all finite factors of $y$ and let $maxPL(y)=\max\{PL(t)\mid t\in Fac(y)\}$. Let $x$ be an infinite non-ultimately periodic word with $maxPL(x)=k<\infty$ and let $u\in Fac(x)$ be a primitive nonempty factor such that $u^5$ is recurrent in $x$. Let $Ψ(x,u)=\{t\in Fac(x)\mid u,u^R\not\in Fac(t)\}\mbox{.}$ We construct an infinite non-u…

2021-03-26cs.DMmath.CO

更多相关论文收起更多论文

Infinite Words with Finite Defect

In this paper, we provide a new characterization of uniformly recurrent words with finite defect based on a relation between the palindromic and factor complexity. Furthermore, we introduce a class of morphisms P_ret closed under composition and we show that a uniformly recurrent word with finite defect is an image of a rich (also called full) word under a morphism of class P_ret. This class is closely related to the well-known class P defined by Hof, Knill, and Simon; every morphism from P_ret is conjugate to a morphism of class P.

2011-01-10math.CO

Occurrences of palindromes in characteristic Sturmian words

This paper is concerned with palindromes occurring in characteristic Sturmian words $c_α$ of slope $α$, where $α\in (0,1)$ is an irrational. As $c_α$ is a uniformly recurrent infinite word, any (palindromic) factor of $c_α$ occurs infinitely many times in $c_α$ with bounded gaps. Our aim is to completely describe where palindromes occur in $c_α$. In particular, given any palindromic factor $u$ of $c_α$, we shall establish a decomposition of $c_α$ with respect to the occurrences of $u$. Such a decomposition shows precisely where $u$ occurs in $c_α$, and this is directly related to the continued…

2007-08-31cs.DMmath.CO

On Brlek-Reutenauer conjecture

Brlek and Reutenauer conjectured that any infinite word u with language closed under reversal satisfies the equality 2D(u)=\sum_{n=0}^{\infty} T(n) in which D(u) denotes the defect of u and T(n) denotes C(n+1)-C(n)+2-P(n+1)-P(n), where C and P are the factor and palindromic complexity of u, respectively. Brlek and Reutenauer verified their conjecture for periodic infinite words. We prove the conjecture for uniformly recurrent words. Moreover, we summarize results and some open problems related to defect, which may be useful for the proof of Brlek-Reutenauer Conjecture in full generality.

2011-01-26math.CO