Asymptotic analysis of \(q\)-recursive sequences

DOI10.1007/s00453-022-00950-yOpenAlexW3163411452MaRDI QIDQ2165029

Daniel Krenn, Gabriel F. Lipnik, Clemens Heuberger

Publication date: 18 August 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.04334

zbMATH Keywords

recurrence relationasymptotic analysisDirichlet seriesThue-Morse sequencesummatory functionregular sequencePascal's triangledigital functionStern's diatomic sequence

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorics on words (68R15) Formal languages and automata (68Q45) Recurrences (11B37) Asymptotic enumeration (05A16) Radix representation; digital problems (11A63) Dirichlet series, exponential series and other series in one complex variable (30B50)

Related Items (1)

A note on the relation between recognisable series and regular sequences, and their minimal linear representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Pascal triangle for binomial coefficients of words
• A pattern sequence approach to Stern's sequence
• Counting the number of non-zero coefficients in rows of generalized Pascal triangles
• Behavior of digital sequences through exotic numeration systems
• The ring of \(k\)-regular sequences
• The ring of \(k\)-regular sequences. II.
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• Joint spectral radius, dilation equations, and asymptotic behavior of radix-rational sequences
• The On-Line Encyclopedia of Integer Sequences
• Asymptotic analysis of regular sequences
• On the values attained by a \(k\)-regular sequence
• Least Periods of Factors of Infinite Words
• Stern's Diatomic Sequence 0,1,1,2,1,3,2,3,1,4,…
• Automatic Sequences
• Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half
• Number Theoretic Aspects of Regular Sequences
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• On the Number of Unbordered Factors
• Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus
• ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
• Counting Subwords Occurrences in Base-b Expansions
• AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
• Binomial Coefficients Modulo a Prime

This page was built for publication: Asymptotic analysis of \(q\)-recursive sequences