Note on a Fibonacci parity sequence

DOI10.1007/S12095-022-00592-5MaRDI QIDQ6159442zbMATH OpenOpenAlexWikidataFDO

Authors Jeffrey Shallit

Publication date 20 June 2023

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2203.10504

zbMATH Keywords

binary sequenceFibonacci representationmaximum order complexityZeckendorf expansion

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Sequences (mod (m)) (11B50) Automata sequences (11B85)

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.

Recommendations

• Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
• scientific article; zbMATH DE number 4112682
• Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
• On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence
• A Fibonacci type sequence with Prouhet-Thue-Morse coefficients

Cites work

• An analogue of the Thue-Morse sequence
• Automata and numeration systems
• Decision algorithms for Fibonacci-automatic words. I: Basic results.
• Enumeration and decidable properties of automatic sequences
• scientific article; zbMATH DE number 3397597 (Why is no real title available?)
• scientific article; zbMATH DE number 3076700 (Why is no real title available?)
• Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
• Möbius orthogonality for the Zeckendorf sum-of-digits function
• Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
• Synchronized sequences
• The Logical Approach to Automatic Sequences
• The sum of digits functions of the Zeckendorf and the base phi expansions

Cited in

(3)

• Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
• Consecutive power occurrences in Sturmian words
• Additive word complexity and \texttt{Walnut}

This page was built for publication: Note on a Fibonacci parity sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159442)