2000 character limit reached
Note on a Fibonacci Parity Sequence (2203.10504v1)
Published 20 Mar 2022 in cs.FL, cs.DM, and math.CO
Abstract: Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in Fibonacci representation. In this note we show how, using the Walnut theorem-prover, to obtain a measure of its complexity, previously studied by Jamet, Popoli, and Stoll. We strengthen one of their theorems and disprove one of their conjectures.