English
Related papers

Related papers: Decomposing the sum-of-digits correlation measure

200 papers

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…

Number Theory · Mathematics 2019-09-24 Manfred G. Madritsch , Jörg M. Thuswaldner

We derive some new finite sums involving the sequence $s_{2}\left(n\right),$ the sum of digits of the expansion of $n$ in base $2.$ These functions allow us to generalize some classical results obtained by Allouche, Shallit and others.

Number Theory · Mathematics 2017-10-20 C. Vignat , T. Wakhare

We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…

Combinatorics · Mathematics 2024-12-02 Sergey Dovgal , Khaydar Nurligareev

We prove connections between Zeckendorf decompositions and Benford's law. Recall that if we define the Fibonacci numbers by $F_1 = 1, F_2 = 2$ and $F_{n+1} = F_n + F_{n-1}$, every positive integer can be written uniquely as a sum of…

It is conjectured that the sum $$ S_r(n)=\sum_{k=1}^{n} \frac{k}{k+r}\binom{n}{k} $$ for positive integers $r,n$ is never integral. This has been shown for $r\le 22$. In this note we study the problem in the ``$n$ aspect" showing that the…

Number Theory · Mathematics 2021-06-16 Florian Luca , Carl Pomerance

We investigate the additive theory of the set $S = \{1^c, 2^c, \dots, N^c\}$ when $c$ is a real number. In the language of additive combinatorics, we determine the asymptotic behaviour of the additive energy of $S$. When $c$ is rational,…

Number Theory · Mathematics 2025-12-04 Joseph Harrison

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

Number Theory · Mathematics 2026-04-28 Terence Tao , Joni Teräväinen

Let $s_{k}(n)$ denote the sum of digits of an integer $n$ in base $k$. Motivated by certain identities of Nieto, and Bateman and Bradley involving sums of the form $\sum_{i=0}^{2^{n}-1}(-1)^{s_{2}(i)}(x+i)^{m}$ for $m=n$ and $m=n+1$, we…

Number Theory · Mathematics 2014-09-30 Jakub Byszewski , Maciej Ulas

Let $G=C_n\oplus C_{mn}$ with $n\geq 2$ and $m\geq 1$, and let $k\in [0,n-1]$. It is known that any sequence of $mn+n-1+k$ terms from $G$ must contain a nontrivial zero-sum of length at most $mn+n-1-k$. The associated inverse question is to…

Number Theory · Mathematics 2021-09-22 David J. Grynkiewicz , Chao Liu

In 1971 Cusick proved that every real number $x\in[0,1]$ can be expressed as a sum of two continued fractions with no partial quotients equal to $1$. In other words, if we define a set $$ S(k):= \{ x\in[0,1] : a_n(x) \geq k \text{ for all }…

Number Theory · Mathematics 2025-06-09 Nikita Shulga

We study the decomposition of real numbers into sums of L\"uroth sets, which are defined by numbers whose L\"uroth expansions have prescribed digit constraints. We establish several results on the congruence modulo 1 of sums of L\"uroth…

Number Theory · Mathematics 2026-02-18 Maiken Gravgaard , Ying Wai Lee

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

Number Theory · Mathematics 2016-01-21 Vladimir Shevelev

Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…

Number Theory · Mathematics 2024-06-12 Kunle Adegoke , Robert Frontczak

Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…

Number Theory · Mathematics 2024-11-18 Pranjal Jain , Shuo Li

We find exact identities for sums of the form \begin{equation*}\label{eq:convsumabs} \sum_{\stackrel{n_1+n_2 = n}{n_1 \in \mathbb{Z} \setminus \{ 0, n \} }} Q(n_1,n_2) \sigma_{-r_1}(n_1) \sigma_{-r_2}(n_2), \end{equation*} where…

Number Theory · Mathematics 2025-12-29 Ksenia Fedosova , Kim Klinger-Logan

In this paper, we study positivity phenomena for the $e$-coefficients of Stanley's chromatic function of a graph. We introduce a new combinatorial object: the {\em correct} sequences of unit interval orders, and using these, in certain…

Combinatorics · Mathematics 2017-03-20 Alexander Paunov , András Szenes

Let $z$ be a real quadratic irrational. We compare the asymptotic behavior of Dedekind sums $S(p_k,q_k)$ belonging to convergents $p_k/q_k$ of the {\em regular} continued fraction expansion of $z$ with that of Dedekind sums $S(s_j/t_j)$…

Number Theory · Mathematics 2014-03-17 Kurt Girstmair

Let $\sigma(n)$ be the sum of the positive divisors of $n$, and let $A(t)$ be the natural density of the set of positive integers $n$ satisfying $\sigma(n)/n \ge t$. We give an improved asymptotic result for $\log A(t)$ as $t$ grows…

Number Theory · Mathematics 2010-11-19 Andreas Weingartner

A More Sums Than Differences (MSTD, or sum-dominant) set is a finite set $A\subset \mathbb{Z}$ such that $|A+A|<|A-A|$. Though it was believed that the percentage of subsets of $\{0,...,n\}$ that are sum-dominant tends to zero, in 2006…

Number Theory · Mathematics 2011-12-15 Geoffrey Iyer , Oleg Lazarev , Steven J. Miller , Liyang Zhang

Divisor functions have attracted the attention of number theorists from Dirichlet to the present day. Here we consider associated divisor functions $c_j^{(r)}(n)$ which for non-negative integers $j, r$ count the number of ways of…

Number Theory · Mathematics 2019-10-08 Matthew C. Lettington , Karl Michael Schmidt
‹ Prev 1 3 4 5 6 7 10 Next ›