dc.contributor.author | Bonardo, Pierre | |
dc.contributor.author | Frid, Anna E. | |
dc.contributor.author | Shallit, Jeffrey | |
dc.date.accessioned | 2020-03-18 17:03:34 (GMT) | |
dc.date.available | 2020-03-18 17:03:34 (GMT) | |
dc.date.issued | 2019-07-05 | |
dc.identifier.uri | https://doi.org/10.1016/j.tcs.2018.12.016 | |
dc.identifier.uri | http://hdl.handle.net/10012/15703 | |
dc.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/ | en |
dc.description.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. | en |
dc.language.iso | en | en |
dc.publisher | Elsevier | en |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | numeration systems | en |
dc.subject | Fibonacci numeration system | en |
dc.subject | Fibonacci word | en |
dc.title | The number of valid factorizations of Fibonacci prefixes | en |
dc.type | Article | en |
dcterms.bibliographicCitation | P. Bonardo et al., The number of valid factorizations of Fibonacci prefixes, Theoret. Comput. Sci. (2019), https://doi.org/10.1016/j.tcs.2018.12.016 | en |
uws.contributor.affiliation1 | Faculty of Mathematics | en |
uws.contributor.affiliation2 | David R. Cheriton School of Computer Science | en |
uws.typeOfResource | Text | en |
uws.peerReviewStatus | Reviewed | en |
uws.scholarLevel | Faculty | en |