We examine oscillations in a number of sums of arithmetic functions involving $Ω(n)$, the total number of prime factors of $n$, and $ω(n)$, the number of distinct prime factors of $n$. In particular, we examine oscillations in $S_α(x) = \sum_{n\leq x} (-1)^{n - Ω(n)}/n^α$ and in $H_α(x) = \sum_{n\leq x} (-1)^{ω(n)}/n^α$ for $α\in[0,1]$, and in $W(x)=\sum_{n\leq x} (-2)^{Ω(n)}$. We show for example that each of the inequalities $S_0(x)<0$, $S_0(x)>3.3\sqrt{x}$, $S_1(x)>0$, and $S_1(x)\sqrt{x}<-3.3$ is true infinitely often, disproving some hypotheses of Sun.
We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument is based on getting an upper bound for the l1 norm of the Fourier coefficients of a generalized arithmetic progression. Our method also applies to give upper bounds for polynomial exponential sums.
Let $γ<1<c$ and $19(c-1)+171(1-γ)<9$. In this paper, we establish an asymptotic formula for exponential sums over Piatetski-Shapiro primes $p=[n^{1/γ}]$ in arithmetic progressions.
In this paper, for coprime numbers p and q we consider the well known Dedekind sums S(p,q) First, we give an improvement of the proof given by H. Rademacher and A. Whiteman, and we construct a new arithmetical proof for the reciprocity law
We prove the analogue of an identity of Huard, Ou, Spearman and Williams and apply it to evaluate a variety of sums involving divisor functions in two variables. It turns out that these sums count representations of positive integers involving radicals.
Let $K$ be a number field. This paper considers arithmetic functions over $K$, that are, complex valued functions on the set of nonzero integral ideals in $K$. Firstly we generalize some basic results on arithmetic functions. Next we define the generalized Ramanujan sums over $K$ and show some properties.
We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression. Based on this distribution, a general formula was obtained for the asymptotic estimate of the sums of functions of primes, and also asymptotics was found for the sums of various functions of primes on a geometric progression. Several assertions about asymptotics of sums of functions of prime numbers on a geometric progression are proved. Necessary and sufficien…
Sums of the singular series constants that appear in the Hardy--Littlewood $k$-tuples conjectures have long been studied in connection to the distribution of primes. We study constrained sums of singular series, where the sum is taken over sets whose elements are specified modulo $r$ or weighted by smooth functions. We show that the value of the sum is governed by incidences modulo $r$ of elements of the set in the case of arithmetic progressions and by pairings of the smooth functions in the case of weights. These sums shed light on sums of singular series in other formats.
We use techniques of relative algebraic K-theory to develop a common refinement of the existing theories of metrized and hermitian Galois structures in arithmetic. As a first application of this very general approach, we then use it to prove several new results, and to formulate a framework of new conjectures, concerning the detailed arithmetic properties of wildly ramified Galois-Gauss sums.
Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the coefficients of F is made completely explicit.
For two arithmetical functions $f$ and $g$, we study the convolution sum of the form $\sum_{n \le N} f(n) g(n+h)$ in the context of its asymptotic formula with explicit error terms. Here we introduce the concept of finite Ramanujan expansion of an arithmetical function and extend our earlier works in this setup.
We consider Mertens' function M(x,q,a) in arithmetic progression, Assuming the generalized Riemann hypothesis (GRH), we show an upper bound that is uniform for all moduli which are not too large. For the proof, a former method of K. Soundararajan is extended to L-series.
For finite sums of non-negative powers of arithmetic progressions the generating functions (ordinary and exponential ones) for given powers are computed. This leads to a two parameter generalization of Stirling and Eulerian numbers. A direct generalization of Bernoulli numbers and their polynomials follows. On the way to find the Faulhaber formula for these sums of powers in terms of generalized Bernoulli polynomials one is led to a one parameter generalization of Bernoulli numbers and their polynomials. Generalized Lah numbers are also considered.
In this note, we characterize all functions $f : \mathbb{N} \rightarrow \mathbb{C}$ such that $f(x_1^2+ \cdots + x_k^2)=f(x_1)^2+ \cdots + f(x_k)^2$, where $k \geq 3$ and $x_1, \cdots, x_k$ are positive integers.
We prove that the equation $(x-2r)^3 + (x-r)^3 + x^3 + (x+r)^3 + (x+2r)^3= y^p$ only has solutions which satisfy $xy=0$ for $1\leq r\leq 10^6$ and $p\geq 5$ prime.
We compute the variances of sums in arithmetic progressions of arithmetic functions associated with certain $L$-functions of degree two and higher in $\mathbb{F}_q[t]$, in the limit as $q\to\infty$. This is achieved by establishing appropriate equidistribution results for the associated Frobenius conjugacy classes. The variances are thus related to matrix integrals, which may be evaluated. Our results differ significantly from those that hold in the case of degree-one $L$-functions (i.e. situations considered previously using this approach). They correspond to expressions found recently in the…
We study the variance of sums of the $k$-fold divisor function $d_k(n)$ over sparse arithmetic progressions, with averaging over both residue classes and moduli. In a restricted range, we confirm an averaged version of a recent conjecture about the asymptotics of this variance. This result is closely related to moments of Dirichlet $L$-functions and our proof relies on the asymptotic large sieve.
We determine primitive solutions to the equation $(x-r)^2 + x^2 + (x+r)^2 = y^n$ for $1 \le r \le 5,000$, making use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.
We introduce new analogues of the Ramanujan sums, denoted by $\widetilde{c}_q(n)$, associated with unitary divisors, and obtain results concerning the expansions of arithmetic functions of several variables with respect to the sums $\widetilde{c}_q(n)$. We apply these results to certain functions associated with $σ^*(n)$ and $ϕ^*(n)$, representing the unitary sigma function and unitary phi function, respectively.
In the present paper, we introduce a multiple Ramanujan sum for arithmetic functions, which gives a multivariable extension of the generalized Ramanujan sum studied by D. R. Anderson and T. M. Apostol. We then find fundamental arithmetic properties of the multiple Ramanujan sum and study several types of Dirichlet series involving the multiple Ramanujan sum. As an application, we evaluate higher-dimensional determinants of higher-dimensional matrices, the entries of which are given by values of the multiple Ramanujan sum.
Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph is the hypergraph of sums of $k$ ($k\geq 1$ fixed) arithmetic progressions. The hyperedges of this hypergraph are of the form $A_{1}+A_{2}+\hdots+A_{k}$ in $[N]$, where the $A_{i}$ are arithmetic progressions. For this hypergraph Hebbinghaus (2004) proved a lower bound of $Ω(N^{k/(2k+2)})$. Note that the probabilistic method gives an upper bound of order $O…
We investigate the coefficients of the polynomial \[ S_{m,r}^n(\ell)=r^n+(m+r)^n+(2m+r)^n+\cdots+((\ell-1)m+r)^n. \] We prove that these can be given in terms of Stirling numbers of the first kind and $r$-Whitney numbers of the second kind. Moreover, we prove a necessary and sufficient condition for the integrity of these coefficients.
We prove recursive formulas involving sums of divisors and sums of triangular numbers and give a variety of identities relating arithmetic functions to divisor functions providing inductive identities for such arithmetic functions.
We obtain several asymptotic formulas for the sum of the divisor function $τ(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced residues modulo $q$ and on average over arbitrary sets. The main goal is to obtain nontrivial results for $q \ge x^{2/3}$ with the small amount of averaging over $a$. We recall that for individual values of $a$ the limit of our current methods is $q \le x^{2/3-\varepsilon}$ for an arbitrary fixed $\varepsilon> 0$. Our method builds on an approach due to Blomer (2008) …
We deduce asymptotic formulas for the alternating sums $\sum_{n\le x} (-1)^{n-1} f(n)$ and $\sum_{n\le x} (-1)^{n-1} \frac1{f(n)}$, where $f$ is one of the following classical multiplicative arithmetic functions: Euler's totient function, the Dedekind function, the sum-of-divisors function, the divisor function, the gcd-sum function. We also consider analogs of these functions, which are associated to unitary and exponential divisors, and other special functions. Some of our results improve the error terms obtained by Bordellès and Cloitre. We formulate certain open problems.
Arithmetic progressions of integers that are relatively prime to their digital sums
The College of Idaho（爱达荷学院）；Cedar Crest College（雪松crest学院）；Bryn Mawr College（布林茅尔学院）；University of Michigan（密歇根大学）；Kutztown University of Pennsylvania（宾夕法尼亚库兹敦大学）
We show that the exponent of distribution of the sequence of squarefree numbers in arithmetic progressions of prime modulus is $\geq 2/3 + 1/57$, improving a result of Prachar from 1958. Our main tool is an upper bound for certain bilinear sums of exponential sums which resemble Kloosterman sums, going beyond what can be obtained by the Polya-Vinogradov completion method.
We give explicit numerical values with 100 decimal digits for the Mertens constant involved in the asymptotic formula for $\sum\limits_{\substack{p\leq x p\equiv a \bmod{q}}}1/p$ and, as a by-product, for the Meissel-Mertens constant defined as $\sum_{p\equiv a \bmod{q}} (\log(1-1/p)+1/p)$, for $q \in \{3$, ..., $100\}$ and $(q, a) = 1$.
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given explicitly in terms of partial Bell polynomials that depend on at most d-1 terms of the generalized Lucas sequence associated with the given recurrence. We also provide an elegant formula for the partial sums of such sequences and illustrate all of our results with examples of various orders, including common generalizations of the Fibonacci numbers.
We prove a bound for quintilinear sums of Kloosterman sums, with congruence conditions on the "smooth" summation variables. This generalizes classical work of Deshouillers and Iwaniec, and is key to obtaining power-saving error terms in applications, notably the dispersion method. As a consequence, assuming the Riemann hypothesis for Dirichlet $L$-functions, we prove a power-saving error term in the Titchmarsh divisor problem of estimating $\sum_{p\leq x}τ(p-1)$. Unconditionally, we isolate the possible contribution of Siegel zeroes, showing it is always negative. Extending work of Fouvry and …
We study the probabilistic behavior of sums of Fourier coefficients in arithmetic progressions. We prove a result analogous to previous work of Fouvry-Ganguly-Kowalski-Michel and Kowalski-Ricotta in the context of half-integral weight holomorphic cusp forms and for prime power modulus. We actually show that these sums follow in a suitable range a mixed Gaussian distribution which comes from the asymptotic mixed distribution of Salié sums.
We obtain asymptotic formulas with remainder terms for the hyperbolic summations $\sum_{mn\le x} f((m,n))$ and $\sum_{mn\le x} f([m,n])$, where $f$ belongs to certain classes of arithmetic functions, $(m,n)$ and $[m,n]$ denoting the gcd and lcm of the integers $m,n$. In particular, we investigate the functions $f(n)=τ(n), \log n, ω(n)$ and $Ω(n)$. We also define a common generalization of the latter three functions, and prove a corresponding result.
We prove upper bounds for sums of Kloosterman sums against general arithmetic weight functions. In particular, we obtain power cancellation in sums of Kloosterman sums over arithmetic progressions, which is of square-root strength in any fixed primitive congruence class up to bounds towards the Ramanujan conjecture.
For $q$ prime, $X \geq 1$ and coprime $u,v \in \mathbb{N}$ we estimate the sums \begin{equation*} \sum_{\substack{p \leq X \substack p \equiv u \hspace{-0.25cm} \mod{v} p \text{ prime}}} \text{Kl}_2(p;q), \end{equation*} where $\text{Kl}_2(p;q)$ denotes a normalised Kloosterman sum with modulus $q$. This is a sparse analogue of a recent theorem due to Blomer, Fouvry, Kowalski, Michel and Milićević showing cancellation amongst sums of Kloosterman sums over primes in short intervals. We use an optimisation argument inspired by Fouvry, Kowalski and Michel. Our argument compares three different bo…
Using only elementary arguments, Cassels and Uchiyama (independently) determined all squares that are sums of three consecutive cubes. Zhongfeng Zhang extended this result and determined all perfect powers that are sums of three consecutive cubes. Recently, the equation $(x-r)^k + x^k + (x+r)^k$ has been studied for $k=4$ by Zhongfeng Zhang and for $k=2$ by Koutsianas. In this paper, we complement the work of Cassels, Koutsianas and Zhang by considering the case when $k=3$ and showing that the equation $(x-r)^3+x^3+(x+r)^3=y^n$ with $n\geq 5$ a prime and $0 < r \leq 10^6$ only has trivial solu…
We establish the equivalence of conjectures concerning the pair correlation of zeros of $L$-functions in the Selberg class and the variances of sums of a related class of arithmetic functions over primes in short intervals. This extends the results of Goldston & Montgomery [7] and Montgomery & Soundararajan [11] for the Riemann zeta-function to other $L$-functions in the Selberg class. Our approach is based on the statistics of the zeros because the analogue of the Hardy-Littlewood conjecture for the auto-correlation of the arithmetic functions we consider is not available in general. One of o…
Let $\gcd(d_{1},\ldots,d_{k})$ be the greatest common divisor of the positive integers $d_{1},\ldots,d_{k}$, for any integer $k\geq 2$, and let $τ$ and $μ$ denote the divisor function and the Möbius function, respectively. For an arbitrary arithmetic function $g$ and for any real number $x>5$ and any integer $k\geq 3$, we define the sum $$ S_{g,k}(x) :=\sum_{n\leq x}\sum_{d_{1}\cdots d_{k}=n} g(\gcd(d_{1},\ldots,d_{k})) $$ In this paper, we give asymptotic formulas for $S_{τ,k}(x)$ and $S_{μ,k}(x)$ for $k\geq 3$.
In this paper we consider the Diophantine equation \begin{align*}b^k +\left(a+b\right)^k &+ \cdots + \left(a\left(x-1\right) + b\right)^k=\\ &=d^l + \left(c+d\right)^l + \cdots + \left(c\left(y-1\right) + d\right)^l, \end{align*} where $a,b,c,d,k,l$ are given integers. We prove that, under some reasonable assumptions, this equation has only finitely many integer solutions.
Recent developments in the theory and application of the Hardy-Littlewood method are discussed, concentrating on aspects associated with diagonal diophantine problems. Recent efficient differencing methods for estimating mean values of exponential sums are described first, concentrating on developments involving smooth Weyl sums. Next, arithmetic variants of classical inequalities of Bessel and Cauchy-Schwarz are discussed. Finally, some emerging connections between the circle method and arithmetic geometry are mentioned.
We present an elementary proof that if $A$ is a finite set of numbers, and the sumset $A+_GA$ is small, $|A+_GA|\leq c|A|$, along a dense graph $G$, then $A$ contains $k$-term arithmetic progressions.
We obtain new bounds for short sums of isotypic trace functions associated to some sheaf modulo prime $p$ of bounded conductor, twisted by the Mobius function and also by the generalised divisor function. These trace functions include Kloosterman sums and several other classical number theoretic objects. Our bounds are nontrivial for intervals of length at least $p^{1/2+\varepsilon}$ with an arbitrary fixed $\varepsilon >0$, which is shorter than the length at least $p^{3/4+\varepsilon}$ in the case of the Mobius function and at least $p^{2/3+\varepsilon}$ in the case of the divisor function r…
We continue our study of convolution sums of two arithmetical functions $f$ and $g$, of the form $\sum_{n \le N} f(n) g(n+h)$, in the context of heuristic asymptotic formulæ. Here, the integer $h\ge 0$ is called, as usual, the {\it shift} of the convolution sum. We deepen the study of finite Ramanujan expansions of general $f,g$ for the purpose of studying their convolution sum. Also, we introduce another kind of Ramanujan expansion for the convolution sum of $f$ and $g$, namely in terms of its shift $h$ and we compare this \lq \lq shifted Ramanujan expansion\rq \rq, with our previous finite e…
In this paper we study the Diophantine equation \begin{align*} b^k + \left(a+b\right)^k + &\left(2a+b\right)^k + \ldots + \left(a\left(x-1\right) + b\right)^k = \\ &y\left(y+c\right) \left(y+2c\right) \ldots \left(y+ \left(\ell-1\right)c\right), \end{align*} where $a,b,c,k,\ell$ are given integers under natural conditions. We prove some effective results for special values for $c,k$ and $\ell$ and obtain a general ineffective result based on Bilu-Tichy method.
We derive certain identities involving various known arithmetical functions and a generalized version of Ramanujan sum. L. Toth constructed certain weighted averages of Ramanujan sums with various arithmetic functions as weights. We choose a generalization of Ramanujan sum given by E. Cohen and derive the weighted averages corresponding to the versions of the weighted averages established by Toth.
In this paper, we determine all primitive solutions to the equation $(x+r)^2 +(x+2r)^2 +\cdots +(x+dr)^2 = y^n$ for $2\leq d\leq 10$ and for $1\leq r\leq 10^4$. We make use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.
Consider the congruence class R_m(a)={a+im:i\in Z} and the infinite arithmetic progression P_m(a)={a+im:i\in N_0}. For positive integers a,b,c,d,m the sum of products set R_m(a)R_m(b)+R_m(c)R_m(d) consists of all integers of the form (a+im)(b+jm)+(c+km)(d+\ell m) for some i,j,k,\ell\in Z. It is proved that if gcd(a,b,c,d,m)=1, then R_m(a)R_m(b)+R_m(c)R_m(d) is equal to the congruence class R_m(ab+cd), and that the sum of products set P_m(a)P_m(b)+P_m(c)P_m(d) eventually coincides with the infinite arithmetic progression P_m(ab+cd).
In this paper we prove a weighted sum formula for multiple harmonic sums modulo primes, thereby proving a weighted sum formula for finite multiple zeta values. Our proof utilizes difference equations for the generating series of multiple harmonic sums. We also conjecture several weighted sum formulas of similar flavor for finite multiple zeta values.
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these established expansions generating sums of the form $\sum_{d: (d,n)=1} f(d)$ (type I) and the Anderson-Apostol sums $\sum_{d|(m,n)} f(d) g(n/d)$ (type II) for any arithmetic functions $f$ and $g$. Our treatment of the type II sums includes a matrix-based factorization method relating the partition function $p(n)$ to arbitrary arithmetic functions $f$. We also conclude…
In this article, we consider weighted sums of generalized polygonal numbers with coefficients $1$ or $2$. We show that for any $m\ge10$, those weighted sums of generalized $m$-gonal numbers represent every non-negative integers if they only represent $1$, $m-4$, and $m-2$. Furthermore, we study representations of sums of four generalized polygonal numbers with coefficients $1$ or $2$.
We compute the variances of sums in arithmetic progressions of generalised k-divisor functions related to certain L-functions in $\mathbb{F}_q(t)$, in the limit as $q\to\infty$. This is achieved by making use of recently established equidistribution results for the associated Frobenius conjugacy classes. The variances are thus expressed, when $q\to\infty$, in terms of matrix integrals, which may be evaluated. Our results extend those obtained previously in the special case corresponding to the usual $k$-divisor function, when the L-function in question has degree one. They illustrate the role …
We prove that the equation $(x-3r)^3+(x-2r)^3 + (x-r)^3 + x^3 + (x+r)^3 + (x+2r)^3+(x+3r)^3= y^p$ only has solutions which satisfy $xy=0$ for $1\leq r\leq 10^6$ and $p\geq 5$ prime. This article complements the work on the equations $(x-r)^3 + x^3 + (x+r)^3 = y^p$ and $(x-2r)^3 + (x-r)^3 + x^3 + (x+r)^3 + (x+2r)^3= y^p$ . The methodology in this paper makes use of the Primitive Divisor Theorem due to Bilu, Hanrot and Voutier for a complete resolution of the Diophantine equation.
