Asymptotic Analysis of q-Recursive Sequences

For an integer q ≥ 2 , a q -recursive sequence is defined by recurrence relations on subsequences of indices modulo some powers of q . In this article, q -recursive sequences are studied and the asymptotic behavior of their summatory functions is analyzed. It is shown that every q -recursive sequen...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 84; H. 9; S. 2480 - 2532
Hauptverfasser:	Heuberger, Clemens, Krenn, Daniel, Lipnik, Gabriel F.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.09.2022 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Asymptotic properties Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation 68Q45 Pascal’s triangle Recurrence relation 30B50 68R05 Summatory function Stern’s diatomic sequence 68R15 Thue–Morse sequence 11B37 Regular sequence Digital function 11A63 Dirichlet series Asymptotic analysis 05A16
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!