English
Related papers

Related papers: Average sizes of mixed character sums

200 papers

Let $f$ be a Steinhaus random multiplicative function, and for $\alpha\in \mathbb{R}$, let $d_\alpha$ denote the $\alpha$-divisor function. For $\alpha \in (1,2)$ we establish that $$ \mathbb{E}\bigg\{\Big|\frac{1}{\sqrt{x}}\sum_{n\leq x}…

Number Theory · Mathematics 2026-04-08 Jad Hamdan

Let $n \ge 2$ be an integer and $\xi$ a transcendental real number. We establish several new relations between the values at $\xi$ of the exponents of Diophantine approximation $w_n, w_{n}^{\ast}, \hat{w}_{n}$, and $\hat{w}_{n}^{\ast}$.…

Number Theory · Mathematics 2017-01-05 Yann Bugeaud , Johannes Schleischitz

Let $p$ be an odd prime. Using I. M. Vinogradov's bilinear estimate, we present an elementary approach to estimate nontrivially the character sum $$ \sum_{x\in H}\chi(x+a),\qquad a\in\Bbb F_p^*, $$ where $H<\Bbb F_p^*$ is a multiplicative…

Number Theory · Mathematics 2014-01-21 Ke Gong

Assuming the Generalized Riemann Hypothesis, the authors study when a character sum over all n <= x is o(x); they show that this holds if log x / log log q -> infinity and q -> infinity (q is the size of the finite field).

Number Theory · Mathematics 2016-09-07 Andrew Granville , K. Soundararajan

The main purpose of this paper is to study higher order moments of the generalized quadratic Gauss sums weighted by $L$-functions using estimates for character sums and analytic methods. We find asymptotic formulas for three character sums…

Number Theory · Mathematics 2021-04-21 Nilanjan Bag , Rupam Barman

We improve a recent result by Shparlinski and Banks related to sums with convolution of Dirichlet characters.

Number Theory · Mathematics 2011-04-05 Dmitry Ushanov

We estimate weighted character sums with determinants $ad-bc $ of $2\times 2$ matrices modulo a prime $p$ with entries $a,b,c,d $ varying over the interval $ [1,N]$. Our goal is to obtain nontrivial bounds for values of $N$ as small as…

Number Theory · Mathematics 2023-03-10 Étienne Fouvry , Igor E. Shparlinski

Let $[x]$ be the integral part of $x$, $n>1$ be a positive integer and $\chi_n$ denote the trivial Dirichlet character modulo $n$. In this paper, we use an identity established by Z. H. Sun to get congruences of…

Number Theory · Mathematics 2022-11-30 Ni Li , Rong Ma

We present quantitative versions of Bohr's theorem on general Dirichlet series $D=\sum a_{n} e^{-\lambda_{n}s}$ assuming different assumptions on the frequency $\lambda:=(\lambda_{n})$, including the conditions introduced by Bohr and…

Functional Analysis · Mathematics 2020-03-26 Ingo Schoolmann

We show that the expected asymptotic for the sums $\sum_{X < n \leq 2X} \Lambda(n) \Lambda(n+h)$, $\sum_{X < n \leq 2X} d_k(n) d_l(n+h)$, and $\sum_{X < n \leq 2X} \Lambda(n) d_k(n+h)$ hold for almost all $h \in [-H,H]$, provided that…

Number Theory · Mathematics 2019-02-19 Kaisa Matomäki , Maksym Radziwiłł , Terence Tao

Let $E$ be an elliptic curve over the finite field $\mathbb{F}_p$, and $P \in E(\mathbb{F}_p)$ be an $\mathbb{F}_p$-rational point. We study the sums \[ S_{\chi,P}(N,h) = \sum_{n=1}^N \chi(\psi_n(P)) \chi(\psi_{n+h}(P)), \] where…

Number Theory · Mathematics 2025-07-15 Subham Bhakta , Igor E. Shparlinski

A square is a word of the form $xx$ for a non-empty word $x$. Brlek and Li [Comb. Theory, 2025] proved that the number of distinct squares in a word $w$ of length $n$ is at most $n - \sigma$, where $\sigma$ is the number of letters used in…

Discrete Mathematics · Computer Science 2026-03-03 Eitatsu Tomita , Tomohiro I

Hardy and Littlewood conjectured that every sufficiently large integer is either a square or the sum of a prime and a square. Let $E(x)$ be the number of positive integers up to $x\ge4$ which does not satisfy this condition. We prove…

Number Theory · Mathematics 2015-04-21 Yuta Suzuki

In the subset sum problem we are given n positive integers along with a target integer t. A solution is a subset of these integers summing to t. In this short note we show that for a given subset sum instance there is a proof of size…

Computational Complexity · Computer Science 2016-02-05 Jesper Nederlof

We study a double Dirichlet series of the form $\sum_{d}L(s,\chi_{d}\chi)\chi'(d)d^{-w}$, where $\chi$ and $\chi'$ are quadratic Dirichlet characters with prime conductors $N$ and $M$ respectively. A functional equation group isomorphic to…

Number Theory · Mathematics 2016-06-16 Alexander Dahl

Consider the well-known Langevin diffusion on $\mathbb{R}^d$ $$\mathrm{d} X_t = -\nabla U(X_t)\,\mathrm{d} t + \sqrt{2}\mathrm{d} B_t, $$ and its Euler-Maruyama discretization given by $$X_{k+1}=X_k-\eta \nabla U(X_k)+\sqrt{2\eta…

Probability · Mathematics 2025-12-23 Tian Shen , Zhonggen Su , Xiaolin Wang

Melchior's inequality implies that the average line-length in a simple, rank-$3$, real-representable matroid is less than $3$. A similar result holds for complex-representable matroids, using Hirzebruch's inequality, but with a weaker bound…

Combinatorics · Mathematics 2024-03-05 Rutger Campbell , Jim Geelen , Matthew E. Kroeker

We prove a theorem about approximation to an irrational number by rational numbers whose denominator n is free of prime factors bigger than a power of log n. We strengthen the result in version 1 by using an exponential sum over smooth…

Number Theory · Mathematics 2020-09-14 Roger Baker

First we generalize a famous lemma of Gallagher on the mean square estimate for exponential sums by plugging a weight in the right hand side of Gallagher's original inequality. Then we apply it in the special case of the Cesaro weight, in…

Number Theory · Mathematics 2016-04-21 Giovanni Coppola , Maurizio Laporta

We give several upper bounds for the uniform simultaneous Diophantine exponent $\widehat{\lambda}_n(\xi)$ of a transcendental number $\xi\in\mathbb{R}$. The most important one relates $\widehat{\lambda}_n(\xi)$ and the ordinary simultaneous…

Number Theory · Mathematics 2021-07-26 Dmitry Badziahin