相关论文: Proof of 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…
We study infinite words u over an alphabet A satisfying the property P : P(n)+ P(n+1) = 1+ #A for any n in N, where P(n) denotes the number of palindromic factors of length n occurring in the language of u. We study also infinite words…
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 \Delta C(n) + 2, for all n \in N. For a large class of words it is a better estimate…
The factor complexity ${\mathcal C}_{\mathbf u}$ of a sequence ${\mathbf u} = u_0u_1u_2 \cdots$ over a finite alphabet counts the number of factors of length $n$ occurring in $\mathbf u$, i.e., ${\mathcal C}_{\mathbf u}(n) = \#{\mathcal…
In this paper we prove that for any infinite word W whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes are palindromes; (II) P(n) + P(n+1) = C(n+1) - C(n) + 2 for…
We show that there exists an uniformly recurrent infinite word whose set of factors is closed under reversal and which has only finitely many palindromic factors.
The prefix palindromic length $PPL_u(n)$ of an infinite word $u$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $u$. In a 2013 paper with Puzynina and Zamboni we stated the conjecture that…
Brlek et al. conjectured in 2008 that any fixed point of a primitive morphism with finite palindromic defect is either periodic or its palindromic defect is zero. Bucci and Vaslet disproved this conjecture in 2012 by a counterexample over…
The non-repetitive complexity $nr\mathcal{C}_{\bf u}$ and the initial non-repetitive complexity $inr\mathcal{C}_{\bf u}$ are functions which reflect the structure of the infinite word ${\bf u}$ with respect to the repetitions of factors of…
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…
In 1999 Lyngs{\o} and Pedersen proposed a conjecture stating that every binary circular word of length $n$ with equal number of zeros and ones has an antipalindromic linear subsequence of length at least $\frac{2}{3}n$. No progress over a…
A universal word (u-word) for $d$-dimensional permutations of length $n$ is a 2-dimensional word with $d-1$ rows, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$…
Universal Cycles, or U-cycles, as originally defined by de Bruijn, are an efficient method to exhibit a large class of combinatorial objects in a compressed fashion, and with no repeats. de Bruijn's theorem states that U-cycles for $n$…
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 +…
We prove that if a uniformly recurrent infinite word contains as a factor any finite permutation of words from an infinite family, then either this word is periodic, or its complexity (that is, the number of factors) grows faster than…
A power is a word of the form $\underbrace{uu...u}_{k \; \text{times}}$, where $u$ is a word and $k$ is a positive integer and a square is a word of the form $uu$. Fraenkel and Simpson conjectured in 1998 that the number of distinct squares…
The prefix palindromic length $p_{\mathbf{u}}(n)$ of an infinite word $\mathbf{u}$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $\mathbf{u}$. This function is surprisingly difficult to…
We regard a finite word $u=u_1u_2\cdots u_n$ up to word isomorphism as an equivalence relation on $\{1,2,\ldots, n\}$ where $i$ is equivalent to $j$ if and only if $x_i=x_j.$ Some finite words (in particular all binary words) are generated…
The prefix palindromic length $\mathrm{PPL}_{\mathbf{u}}(n)$ of an infinite word $\mathbf{u}$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $\mathbf{u}$. Since 2013, it is still unknown if…
We prove a 2018 conjecture of Krawchuk and Rampersad on the extremal behavior of $c(n)$, where $c(n)$ counts the number of length-$n$ factors of the Thue-Morse word $\mathbf{t}$, up to cyclic rotation.