Search

We consider an infinite word $\boldsymbol{u}$ fixed by a primitive morphism. We show a necessary condition under which $\boldsymbol{u}$ has a non-trivial geometric representation which is bounded distance equivalent to a lattice.

Spectra of suitably chosen Pisot-Vijayaraghavan numbers represent non-trivial examples of self-similar Delone point sets of finite local complexity, indispensable in quasicrystal modeling. For the case of quadratic Pisot units we characterize, dependingly on digits in the corresponding numeration systems, the spectra which are bounded distance to an average lattice. Our method stems in interpretation of the spectra in the frame of the cut-and-project method. Such structures are coded by an infinite word over a finite alphabet which enables us to exploit combinatorial notions such as balancedness, substitutions and the spectrum of associated incidence matrices.

We introduce two classes of morphisms over the alphabet $A=\{0,1\}$ whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant under the action of the antimorphism $\mathrm{E}:\{0,1\}^*\to\{0,1\}^*$, defined by $\mathrm{E}(w_1\cdots w_n)=(1-w_{n})\cdots(1-w_1)$. We conjecture that these two classes contain all morphisms (up to conjugation) which generate infinite words with infinitely many antipalindromes. This is an analogue to the famous HKS conjecture concerning infinite words containing infinitely many palindromes. We prove our conjecture for two special classes of morphisms, namely (i) uniform morphisms and (ii) morphisms with fixed points containing also infinitely many palindromes.

We study the palindromic length of factors of infinite words fixed by morphisms of the so-called class $\mathcal{P}$ introduced by Hof, Knill and Simon. We show that it grows at most logarithmically with the length of the factor. For the Fibonacci word and the Thue-Morse word we provide estimates on the constants of the growth. We also construct an infinite word rich in palindromes for which the palindromic length grows as $\sqrt{n}$.

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 to each positive integer $n$, the maximal palindromic length of factors of length $n$ in $u$. Recently, Frid (2018) proved that $\limsup_{n\to\infty} PL_{u}(n)=+\infty$ for any Sturmian word $u$. We show that there is a constant $K>0$ such that $PL_{u}(n)\leq K\ln n$ for every Sturmian word $u$, and that for each non-decreasing function $f$ with property $\lim_{n\to\infty}f(n)=+\infty$ there is a Sturmian word $u$ such that $PL_{u}(n)=O(f(n))$.

WORDS is the main international event in Combinatorics on Words. It is a biannual conference devoted to research of words (i.e., finite or infinite sequences of symbols over a finite alphabet) from combinatorial, algebraic and algorithmic points of view. The emphasis of the conference is on mathematical theory of words but the conference is also open to applications, mainly in computer science, biology, linguistics and physics, gaining from the fact that words arise as a natural object in many areas. The eighth edition of the conference was organized in Prague from 12th to 16th September 2011 as a joint undertaking of the Czech Technical University and the Charles University. This volume consists of contributed papers accepted for presentation at the conference and summaries of invited lectures., Comment: EPTCS 63, 2011

We consider exchange of three intervals with permutation $(3,2,1)$. The aim of this paper is to count the cardinality of the set $3\iet(N)$ of all words of length $N$ which appear as factors in infinite words coding such transformations. We use the strong relation of 3iet words and words coding exchange of two intervals, i.e., Sturmian words. The known asymptotic formula $# 2\iet(N)/N^3\sim\frac1{\pi^2}$ for the number of Sturmian factors allows us to find bounds $\frac1{3\pi^2} + o(1) \leq # 3\iet(N)/N^4 \leq \frac2{\pi^2} + o(1)$., Comment: 14 pages, 7 figures

We consider words coding exchange of three intervals with permutation (3,2,1), here called 3iet words. Recently, a characterization of substitution invariant 3iet words was provided. We study the opposite question: what are the morphisms fixing a 3iet word? We reveal a narrow connection of such morphisms and morphisms fixing Sturmian words using the new notion of amicability., Comment: 13 pages, 5 figures

A simple Parry number is a real number \beta>1 such that the R\'enyi expansion of 1 is finite, of the form d_\beta(1)=t_1...t_m. We study the palindromic structure of infinite aperiodic words u_\beta that are the fixed point of a substitution associated with a simple Parry number \beta. It is shown that the word u_\beta contains infinitely many palindromes if and only if t_1=t_2= ... =t_{m-1} \geq t_m. Numbers \beta satisfying this condition are the so-called confluent Pisot numbers. If t_m=1 then u_\beta is an Arnoux-Rauzy word. We show that if \beta is a confluent Pisot number then P(n+1)+ P(n) = C(n+1) - C(n)+ 2, where P(n) is the number of palindromes and C(n) is the number of factors of length n in u_\beta. We then give a complete description of the set of palindromes, its structure and properties., Comment: 28 pages, to appear in Annales de l'Institut Fourier