Topological invariants for words of linear factor complexity
Abstract
Given a finite alphabet and a right-infinite word over the alphabet , we construct a topological space consisting of all right-infinite recurrent words whose factors are all factors of , where we work up to an equivalence in which two words are equivalent if they have the exact same set of factors (finite contiguous subwords). We show that can be endowed with a natural topology and we show that if is word of linear factor complexity then is a finite topological space. In addition, we note that there are examples which show that if is a function that tends to infinity as then there is a word whose factor complexity function is such that is an infinite set. Finally, we pose a realization problem: which finite topological spaces can arise as for a word of linear factor complexity?
Keywords
Cite
@article{arxiv.2202.00643,
title = {Topological invariants for words of linear factor complexity},
author = {Jason Bell},
journal= {arXiv preprint arXiv:2202.00643},
year = {2022}
}
Comments
14 pages