Behavior of digital sequences through exotic numeration systems

zbMath1376.11004arXiv1705.08322MaRDI QIDQ521363

Michel Rigo, Manon Stipulanti, Julien Leroy

Publication date: 10 April 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

summatory functions\(k\)-regular sequencesbinomial coefficients of words

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Radix representation; digital problems (11A63) Automata sequences (11B85)

Related Items (4)

Asymptotic analysis of \(q\)-recursive sequences ⋮ Convergence of Pascal-like triangles in Parry-Bertrand numeration systems ⋮ Counting Subwords Occurrences in Base-b Expansions ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Pascal triangle for binomial coefficients of words
• Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated
• Counting the number of non-zero coefficients in rows of generalized Pascal triangles
• The ring of \(k\)-regular sequences
• Sur la fonction sommatoire de la fonction 'somme des chiffres'
• Additive functions with respect to numeration systems on regular languages
• The ring of \(k\)-regular sequences. II.
• On the sum of digits functions for number systems with negative bases
• Joint spectral radius, dilation equations, and asymptotic behavior of radix-rational sequences
• Output sum of transducers: limiting distribution and periodic fluctuation
• Automatic Sequences
• An Explicit Expression for Binary Digital Sums

This page was built for publication: Behavior of digital sequences through exotic numeration systems