English
Related papers

Related papers: On Kloosterman sums with multiplicative coefficien…

200 papers

We study for bounded multiplicative functions $f$ sums of the form \begin{align*} \sum_{\substack{n\leq x \atop n\equiv a\pmod q}}f(n), \end{align*} establishing that their variance over residue classes $a \pmod q$ is small as soon as…

Number Theory · Mathematics 2023-08-24 Oleksiy Klurman , Alexander P. Mangerel , Joni Teräväinen

Kloosterman sums for a finite field arise as Frobenius trace functions of certain local systems defined over $\Gm$. The moments of Kloosterman sums calculate the Frobenius traces on the cohomology of tensor powers (or symmetric powers,…

Number Theory · Mathematics 2019-02-20 Zhiwei Yun

For sufficiently large integers $K$, $x$, $y$, and $q$ satisfying $K \le y < x$, where $f(u) = \alpha u^n + \alpha_{n-1}u^{n-1} + \ldots + \alpha_1 u$ is a polynomial of degree $n$ with real coefficients, $n$ is a fixed positive integer,…

Number Theory · Mathematics 2025-10-13 Firuz Rakhmonov

In this paper, we construct an infinite family of binary linear codes associated with double cosets with respect to certain maximal parabolic subgroup of the orthogonal group O(2n+1,q). Here q is a power of two. Then we obtain an infinite…

Number Theory · Mathematics 2009-09-07 Dae San Kim

The maximal degree over rational numbers that an n-dimensinonal Kloosterman sum defined over a finite field of characteristic p can achieve is known to be (p-1)/d where d=gcd(p-1,n+1). Wan has shown that this maximal degree is always…

Number Theory · Mathematics 2011-07-04 Keijo Kononen , Marko Rinta-aho , Keijo Väänänen

A multiplicative function $f$ is said to be resembling the M\"{o}bius function if $f$ is supported on the square-free integers, and $f(p)=\pm 1$ for each prime $p$. We prove $O$- and $\Omega$-results for the summatory function $\sum_{n\leq…

Number Theory · Mathematics 2022-06-10 Qingyang Liu

For the quantum integer $[n]_q = 1+q+...+q^{n-1}$ there is a natural polynomial multiplication $*_q$ such that $[m]_q *_q [n]_q = [mn]_q$. This multiplication leads to the functional equation $f_{mn}(q) = f_m(q)f_n(q^m),$ defined on a given…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

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 deduce an asymptotic formula with error term for the sum $\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k])$, where $[n_1,\ldots, n_k]$ stands for the least common multiple of the positive integers $n_1,\ldots, n_k$ ($k\ge 2$) and $f$…

Number Theory · Mathematics 2016-07-27 Titus Hilberdink , László Tóth

We study p-adic hyper-Kloosterman sums, a generalization of the Kloosterman sum with a parameter k that recovers the classical Kloosterman sum when k=2, over general p-adic rings and even equal characteristic local rings. These can be…

Number Theory · Mathematics 2023-06-01 Will Sawin

A Kloosterman refinement for function fields $K=\mathbb{F}_q(t)$ is developed and used to establish the quantitative arithmetic of the set of rational points on a smooth complete intersection of two quadrics $X\subset \mathbb{P}^{n-1}_{K}$…

Number Theory · Mathematics 2019-07-17 Pankaj Vishe

Let $\Omega(n)$ denote the number of prime factors of $n$. We show that for any bounded $f\colon\mathbb{N}\to\mathbb{C}$ one has \[ \frac{1}{N}\sum_{n=1}^N\, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N\, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1).…

Number Theory · Mathematics 2022-05-16 Florian K. Richter

In this article, we investigate large values of Dirichlet character sums with multiplicative coefficients $\sum_{n\le N}f(n)\chi(n)$. We prove an Omega result in the region $\exp((\log q)^{\frac12+\varepsilon})\le N\le\sqrt q$, where $q$ is…

Number Theory · Mathematics 2025-08-14 Zikang Dong , Zhonghua Li , Yutong Song , Shengbo Zhao

In this paper we prove new upper bounds for the sum $\sum_{n=a+1}^{a+N}f(n)$, for a certain class of arithmetic functions $f$. Our results improve the previous results of G. Bachman and L. Rachakonda.

Number Theory · Mathematics 2011-07-05 Dmitriy Frolenkov

In this paper, we investigate the large deviations of sums of weighted random variables that are approximately independent, generalizing and improving some of the results of Montgomery and Odlyzko. We are motivated by examples arising from…

Number Theory · Mathematics 2021-05-05 Andrew Granville , Youness Lamzouri

Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is a $3$-gleeful number, and $195=5^2+7^2+11^2$ is $2$-gleeful.…

Number Theory · Mathematics 2025-07-15 Sara Moore , Jonathan P. Sorenson

We prove that if $f$ is a random completely multiplicative function, conditional $f(p)=1$ for each prime $p \le (\log x)^{2-\epsilon}$, the probability that $\sum_{1\le n \le N}f(n)\ge 0$ for all $N\le x$ is $o(1)$ as $x \rightarrow…

Number Theory · Mathematics 2026-03-25 Rodrigo Angelo , Max Wenqiang Xu

The $q$-sum $x \oplus_q y \equiv x+y+(1-q) xy$ ($x \oplus_1 y=x+y$) and the $q$-product $x\otimes_q y \equiv [x^{1-q} +y^{1-q}-1]^{\frac{1}{1-q}}$ ($x\otimes_1 y=x y$) emerge naturally within nonextensive statistical mechanics. We show here…

Statistical Mechanics · Physics 2009-11-13 V. Schwammle , C. Tsallis

We consider a sequence $\{f(p)\}_{p\ {\rm prime}}$ of independent random variables taking values $\pm 1$ with probability $1/2$, and extend $f$ to a multiplicative arithmetic function defined on the squarefree integers. We investigate upper…

Number Theory · Mathematics 2017-12-07 Joseph Basquin

A sequence of functions {f_n(q)}_{n=1}^{\infty} satisfies the functional equation for multiplication of quantum integers if f_{mn}(q) = f_m(q)f_n(q^m) for all positive integers m and n. This paper describes the structure of all sequences of…

Number Theory · Mathematics 2016-12-30 Alexander Borisov , Yang Wang , Melvyn B. Nathanson