Related papers: A note on palindromicity
In this paper, we investigate the combinatorial and density properties of infinite words generated by Fibonacci-type morphisms, focusing on their subword structure, palindrome density, and extremal statistical behaviors. Using the morphism…
An algebra is finitely related (or has finite degree) if its term functions are determined by some finite set of finitary relations. Nilpotent monoids built from words, via Rees quotients of free monoids, have been used to exhibit many…
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…
Let p be a maximal palindrome in a Sturmian word s=ul_1pl_2v so that p is a palindrome and l_1pl_2 is not for letters l_1 and l_2. Let {\alpha}(p,p') be a morphism mapping letters a and b respectively to a^pb and a^p'b, |p-p'|=1. In this…
We settle an open problem regarding palindromes; that is, positive integers which are the same when written forwards and backwards. In particular, we prove that for any fixed base $b\geq 2$, there exist infinitely many square-free…
We study the periods of Markov sequences, which are derived from the continued fraction expression of elements in the Markov spectrum. This spectrum is the set of minimal values of indefinite binary quadratic forms that are specially…
Frid, Puzynina and Zamboni (2013) defined the palindromic length of a finite word $w$ as the minimal number of palindromes whose concatenation is equal to $w$. For an infinite word $u$ we study $PL_{u}$, that is, the function that assigns…
We study morphisms from certain classes and their action on episturmian words. The first class is $P_{ret}$. In general, a morphism of class $P_{ret}$ can map an infinite word having zero palindromic defect to a word having infinite…
The present paper records more details of the relationship between primitive elements and palindromes in F_2, the free group of rank two. We characterise the conjugacy classes of primitive elements which contain palindromes as those which…
In [A. Frid, S. Puzynina, L.Q. Zamboni, \textit{On palindromic factorization of words}, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any infinite word whose palindromic lengths of factors are bounded is ultimately…
We study aperiodic balanced sequences over finite alphabets. A sequence vv of this type is fully characterised by a Sturmian sequence u and two constant gap sequences y and y'. We show that the language of v is eventually dendric and we…
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…
We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n x n -grid and sets of finite Sturmian words of length n. Using this mapping, we give new proofs of the formulas enumerating…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
We prove that the property of being closed (resp., palindromic, rich, privileged trapezoidal, balanced) is expressible in first-order logic for automatic (and some related) sequences. It therefore follows that the characteristic function of…
We give a new characterization of biinfinite Sturmian sequences in terms of indistinguishable asymptotic pairs. Two asymptotic sequences on a full $\mathbb{Z}$-shift are indistinguishable if the sets of occurrences of every pattern in each…
A recursively palindromic (RP) word is one that is a palindrome and whose left half-word and right half-word are each RP. Thus ABACABA is, and MADAM is not, an RP word. We count RP words of given length over a finite alphabet and RP…
We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$. We give…
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…
We extend the classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number $n$ better reflect the structure of the associated Sturmian…