Novel Constructions of Words with Strong Avoidance Properties and their Combinatorial Analysis

Abstract

This paper begins with a comprehensive overview of combinatorics on words and symbolic dynamics, covering their historical origins, fundamental concepts, and interconnections. Building upon this foundation, we introduce novel mathematical constructions related to pattern avoidance in infinite words. Specifically, we define Strongly $(k, \delta)$-Free Words generated via cyclic shift morphisms and present a theorem establishing specific avoidance properties for these words, along with a detailed proof. Furthermore, we propose a conjecture regarding their factor complexity. These original results contribute to the theoretical understanding of word structures and their combinatorial properties, opening avenues for further research in discrete mathematics.