Power and exponential sums for generalized coding systems by a measure theoretic approach

DOI10.1016/j.tcs.2015.05.010zbMath1397.94036arXiv1505.04230OpenAlexW267505688MaRDI QIDQ500963

Yasunobu Shiota, Takeshi Sekiguchi, Yuichi Kamiya, Tatsuya Okada

Publication date: 8 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

exponential sumprobability measureTakagi functionpaperfolding sequencepower sumcoding system

Mathematics Subject Classification ID

Trigonometric and exponential sums (general theory) (11L03) Source coding (94A29) Classical measure theory (28A99)

Related Items (1)

Global extrema of the Delange function, bounds for digital sums and concave functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Certain codes related to generalized paperfolding sequences
• Distribution of the sum-of-digits function of random integers: a survey
• Gaussian asymptotic properties of the sum-of-digits function
• A generalization of Hata-Yamaguti's results on the Takagi function. II: Multinomial case
• Relations among arithmetical functions, automatic sequences, and sum of digits functions induced by certain Gray codes
• Paperfolding morphisms, planefilling curves, and fractal tiles
• A summation formula related to the binary digits
• A generalization of Hata-Yamaguti's results on the Takagi function
• Contributions to digit expansions with respect to linear recurrences
• A probability measure which has Markov property
• Power sums of digital sums
• Exponential sums of sum-of-digit functions
• Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
• Sur la fonction sommatoire de la fonction 'somme des chiffres'
• Mellin transforms and asymptotics: Digital sums
• Applications of binomial measures to power sums of digital sums
• An explicit formula of the exponential sums of digital sums
• Digital sum moments and substitutions
• The Takagi function and its generalization
• A Note on Gray Code and Odd-Even Merge
• Number of Odd Binomial Coefficients
• Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity
• Automatic Sequences
• Digital Sum Problems for the Gray Code Representation of Natural Numbers
• An Explicit Expression for Binary Digital Sums
• Length of strings for a merge sort
• An Asymptotic Formula for the Average Sum of the Digits of Integers

This page was built for publication: Power and exponential sums for generalized coding systems by a measure theoretic approach