Colin Krawchuk
https://hdl.handle.net/10680/1418
Wed, 17 Aug 2022 07:46:43 GMT2022-08-17T07:46:43ZCyclic Complexity of Some Infinite Words and Generalizations
https://hdl.handle.net/10680/1417
Cyclic Complexity of Some Infinite Words and Generalizations
Krawchuk, Colin; Rampersad, Narad
Cassaigne et al. introduced the cyclic complexity function c_x(n), which gives the number of cyclic conjugacy classes of length-n factors of a word x. We study the behavior of this function for the Fibonacci word f and the Thue–Morse word t. If φ = (1 + √5)/2, we show that lim sup_{n → 1} c_f(n)/n ≥ 2/φ² and conjecture that equality holds. Similarly, we show that lim sup_{n → 1} c_t(n)/n ≥ 2 and conjecture that
equality holds. We also propose a generalization of the cyclic complexity function and suggest some directions for further investigation. Most results are obtained by computer proofs using Mousavi’s Walnut software.
Thu, 01 Mar 2018 00:00:00 GMThttps://hdl.handle.net/10680/14172018-03-01T00:00:00Z