Construction of a bi-infinite power free word with a given factor and a non-recurrent letter

TL;DR

This paper proves the existence of bi-infinite power-free words containing a given factor and a non-recurrent letter, under certain conditions on the power exponent and alphabet size.

Contribution

It establishes the construction of bi-infinite power-free words with a specified factor and a non-recurrent letter, expanding understanding of their structural properties.

Findings

Existence of bi-infinite power-free words with a given factor

Construction of words with a non-recurrent letter

Conditions on alpha and alphabet size for the construction

Abstract

Let $L_{k,\alpha}^{\mathbb{Z}}$ denote the set of all bi-infinite $\alpha$-power free words over an alphabet with $k$ letters, where $\alpha$ is a positive rational number and $k$ is positive integer. We prove that if $\alpha\geq 5$, $k\geq 3$, $v\in L_{k,\alpha}^{\mathbb{Z}}$, and $w$ is a finite factor of $v$, then there are $\widetilde v\in L_{k,\alpha}^{\mathbb{Z}}$ and a letter $x$ such that $w$ is a factor of $\widetilde v$ and $x$ has only a finitely many occurrences in $\widetilde v$.