Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
Crossref DOI link: https://doi.org/10.1007/s12095-021-00507-w
Published Online: 2021-07-07
Published Print: 2021-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Jamet, Damien
Popoli, Pierre http://orcid.org/0000-0002-4243-9180
Stoll, Thomas
Text and Data Mining valid from 2021-07-07
Version of Record valid from 2021-07-07
Article History
Received: 18 May 2021
Accepted: 9 June 2021
First Online: 7 July 2021
Declarations
:
: The authors declare that they have no conflict of interest.