The number of valid factorizations of Fibonacci prefixes
Loading...
Date
Authors
Bonardo, Pierre
Frid, Anna E.
Shallit, Jeffrey
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Abstract
We establish several recurrence relations and an explicit formula for V(n), the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci words. In particular, we show that the sequence V(n) is the shuffle of the ceilings of two linear functions of n.
Description
The final publication is available at Elsevier via https://doi.org/10.1016/j.tcs.2018.12.016. © 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Citation
Collections
Endorsement
Review
Supplemented By
Referenced By
Creative Commons license
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International