Related papers: Summing the sum of digits

Using probability theory we derive an expression for the sum of a series of definite integrals involving upper incomplete Gamma functions. In the proof, a normal variance mixture distribution with Beta mixing distributions plays a crucial…

This paper focuses on the discrimination capacity of aggregation functions: these are the permutation invariant functions used by graph neural networks to combine the features of nodes. Realizing that the most powerful aggregation functions…

This work considers normalized inverse determinant sums as a tool for analyzing the performance of division algebra based space-time codes for multiple antenna wireless systems. A general union bound based code design criterion is obtained…

We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query…

We consider the sum-of-digits functions $s_2$ and $s_3$ in bases $2$ and $3$. These functions just return the minimal numbers of powers of two (resp. three) needed in order to represent a nonnegative integer as their sum. A result of the…

In many applications such as web-based search, document summarization, facility location and other applications, the results are preferable to be both representative and diversified subsets of documents. The goal of this study is to select…

A sum rule is an identity connecting the entropy of a measure with coefficients involved in the construction of its orthogonal polynomials (Jacobi coefficients). Our paper is an extension of Gamboa, Nagel and Rouault (2016), where we have…

Let $\{a_{1}, a_{2},\ldots, a_{n},\ldots\}$ be a sequence of complex numbers which has at most polynomial growth and satisfies an extra assumption. In this paper, inspired by a recent work of Sasane, we give an explanation of the sum…

Let $G=(G_j)_{j\ge 0}$ be a strictly increasing linear recurrent sequence of integers with $G_0=1$ having characteristic polynomial $X^{d}-a_1X^{d-1}-\cdots-a_{d-1}X-a_d$. It is well known that each positive integer $\nu$ can be uniquely…

In this paper we investigate congruence relationships of particular finite generalized harmonic numbers sums. We suggest more transparent and simpler method to analyse these sums and present several additional results for certain special…

We study the joint distribution of the number of occurrences of members of a collection of nonoverlapping motifs in digital data. We deal with finite and countably infinite collections. For infinite collections, the setting requires that we…

We look at sequences of positive integers that can be realized as degree sequences of iterates of rational dominant maps of smooth projective varieties over arbitrary fields. New constraints on the degree growth of endomorphisms of the…

We investigate three combinatorial problems considered by Erd\"os, Rivat, Sark\"ozy and Sch\"on regarding divisibility properties of sum sets and sets of shifted products of integers in the context of function fields. Our results in this…

We consider the sum of squared logarithms inequality and investigate possible connections with the theory of majorization. We also discuss alternative sufficient conditions on two sets of vectors $a,b\in\mathbb{R}_+^n$ so that…

We prove a Central Limit Theorem for probability measures defined via the variation of the sum-of-digits function, in base $b\ge 2$. For $r\ge 0$ and $d \in \mathbb{Z}$, we consider $\mu^{(r)}(d)$ as the density of integers $n\in…

Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…

This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…

As a generalization of the sum of digits function and other digital sequences, sequences defined as the sum of the output of a transducer are asymptotically analyzed. The input of the transducer is a random integer in $[0, N)$. Analogues in…

We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence…

We derive and prove an explicit formula for the sum of the fractional parts of certain geometric series. Although the proof is straightforward, we have been unable to locate any reference to this result. This summation formula allows us to…