The number of valid factorizations of Fibonacci prefixes

dc.contributor.authorBonardo, Pierre
dc.contributor.authorFrid, Anna E.
dc.contributor.authorShallit, Jeffrey
dc.date.accessioned2020-03-18T17:03:34Z
dc.date.available2020-03-18T17:03:34Z
dc.date.issued2019-07-05
dc.descriptionThe 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/en
dc.description.abstractWe 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.en
dc.identifier.urihttps://doi.org/10.1016/j.tcs.2018.12.016
dc.identifier.urihttp://hdl.handle.net/10012/15703
dc.language.isoenen
dc.publisherElsevieren
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectnumeration systemsen
dc.subjectFibonacci numeration systemen
dc.subjectFibonacci worden
dc.titleThe number of valid factorizations of Fibonacci prefixesen
dc.typeArticleen
dcterms.bibliographicCitationP. Bonardo et al., The number of valid factorizations of Fibonacci prefixes, Theoret. Comput. Sci. (2019), https://doi.org/10.1016/j.tcs.2018.12.016en
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2David R. Cheriton School of Computer Scienceen
uws.peerReviewStatusRevieweden
uws.scholarLevelFacultyen
uws.typeOfResourceTexten

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
1-s2.0-S0304397518307497-main.pdf
Size:
416.95 KB
Format:
Adobe Portable Document Format
Description:
Accepted manuscript

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
4.47 KB
Format:
Item-specific license agreed upon to submission
Description: