Divide-and-conquer generating functions. Part I. Elementary sequences

Simple item page
dc.creatorStephan, Ralf
dc.date2003-07-02
dc.date.accessioned2026-07-07T04:59:21Z
dc.date.available2026-07-07T04:59:21Z
dc.descriptionDivide-and-conquer functions satisfy equations in F(z),F(z^2),F(z^4)... Their generated sequences are mainly used in computer science, and they were analyzed pragmatically, that is, now and then a sequence was picked out for scrutiny. By giving several classes of ordinary generating functions together with recurrences, we hope to help with the analysis of many such sequences, and try to classify a part of the divide-and-conquer sequence zoo.
dc.description5 pages, LaTeX, no figures
dc.identifierhttps://arxiv.org/abs/math/0307027
dc.identifierhttp://arxiv.org/abs/math/0307027
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67952
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.subject68R05, 11B37
dc.titleDivide-and-conquer generating functions. Part I. Elementary sequences
dc.typetext

Files

Collections

arXiv