English
Related papers

Related papers: Kloosterman Sums with Multiplicative Coefficients

200 papers

In this paper, by constructing some identities, we prove some $q$-analogues of some congruences. For example, for any odd integer $n>1$, we show that \begin{gather*} \sum_{k=0}^{n-1} \frac{(q^{-1};q^2)_k}{(q;q)_k} q^k \equiv (-1)^{(n+1)/2}…

Number Theory · Mathematics 2020-03-25 Chen Wang , He-Xia Ni

We study multiplicative functions $f$ satisfying $|f(n)|\le 1$ for all $n$, the associated Dirichlet series $F(s):=\sum_{n=1}^{\infty} f(n) n^{-s}$, and the summatory function $S_f(x):=\sum_{n\le x} f(n)$. Up to a possible trivial…

Number Theory · Mathematics 2022-10-27 Éric Saïas , Kristian Seip

We study the average value of the divisor function $\tau(n)$ for $n\le x$ with $n \equiv a \bmod q$. The divisor function is known to be evenly distributed over arithmetic progressions for all $q$ that are a little smaller than $x^{2/3}$.…

Number Theory · Mathematics 2016-05-25 Rizwanur Khan

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

Combinatorics · Mathematics 2026-03-16 D. S. Gireesh , B. Hemanthkumar

Given a multiplicative function $f$ which is periodic over the primes, we obtain a full asymptotic expansion for the shifted convolution sum $\sum_{|h|<n\leq x} f(n) \tau(n-h)$, where $\tau$ denotes the divisor function and…

Number Theory · Mathematics 2020-01-08 Sary Drappeau , Berke Topacogullari

We study the mean square of sums of the $k$th divisor function $d_k(n)$ over short intervals and arithmetic progressions for the rational function field over a finite field of $q$ elements. In the limit as $q\rightarrow\infty$ we establish…

Number Theory · Mathematics 2020-01-28 Jon Keating , Brad Rodgers , Edva Roditty-Gershon , Zeev Rudnick

Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…

Number Theory · Mathematics 2022-04-19 Yujiao Jiang , Guangshi Lü

We study two models of random multiplicative functions: Rademacher random multiplicative functions supported on the squarefree integers $f$, and Rademacher random completely multiplicative functions $f^*$. We prove that the partial sums…

Number Theory · Mathematics 2024-01-26 Marco Aymone

Let $E$ be an elliptic curve over the finite field $\mathbb F_q$. We prove that, when $n$ is a sufficiently large positive integer, $\#E(\mathbb F_{q^n})$ has a prime factor exceeding $n\exp(c\log n/\log\log n)$.

Number Theory · Mathematics 2021-12-15 Yuri Bilu , Haojie Hong , Florian Luca

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…

Number Theory · Mathematics 2021-05-31 Randell Heyman , László Tóth

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,…

Number Theory · Mathematics 2016-12-30 László Tóth

We provide uniform bounds on mean values of multiplicative functions under very general hypotheses, detecting certain power savings missed in known results in the literature. As an application, we study the distribution of the…

Number Theory · Mathematics 2023-11-09 Akash Singha Roy

Let $\tau_k$ be the $k$-fold divisor function. By constructing an approximant of $\tau_k$, denoted as $\tau_k^*$, which is a normalized truncation of the $k$-fold divisor function, we prove that when $\exp\left(C\log^{1/2}X(\log\log…

Number Theory · Mathematics 2024-07-09 Mengdi Wang

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum…

Information Theory · Computer Science 2010-01-29 Xiwang Cao , Lei Hu

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum…

Information Theory · Computer Science 2010-01-26 Xiwang Cao , Lei Hu

For completely multiplicative functions f(n) taking values 1 and -1, under certain conditions on f(n) we show that f(n) changes sign at least x exp(-7(log log x)sqrt(log x)) times as n runs through the integers <= x.

Number Theory · Mathematics 2007-05-23 Ernie Croot

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

Combinatorics · Mathematics 2016-10-18 Jacob Sprittulla

Let $q\geqslant2$ be an integer, $\chi$ be any non-principal character mod $q$, and $H=H(q)\leqslant q.$ In this paper the authors prove some estimates for character sums of the form…

Number Theory · Mathematics 2009-12-08 Ping Xi , Yuan Yi

Let the symmetric functions be defined for the pair of integers $\left( n,r\right) $, $n\geq r\geq 1$, by $p_{n}^{\left( r\right) }=\sum m_{\lambda }$ where $m_{\lambda }$ are the monomial symmetric functions, the sum being over the…

Combinatorics · Mathematics 2025-05-08 Vincent Brugidou

Let $ E=\{ (1, b_1, \ldots , b_n)\in R^{n+1} \mid \; b_i= \pm 1 ,\; i=1, \ldots, n \}$, $E^{\times n}_{\ne 0} := \{ W=(w_{i_1}, \ldots , w_{i_n}) \mid w_{i_k}\in E, \, k=1, \ldots, n, \, dim \, span(w_{i_1}, \ldots , w_{i_n}) = n \},$ and…

Combinatorics · Mathematics 2018-11-27 Anwar Irmatov