Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 24 Feb 2022 in cs.FL, cs.DM, and math.CO | (2202.12038v2)

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$.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.