中文
相关论文

相关论文: Shifted Character Sums with Multiplicative Coeffic…

200 篇论文

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

数论 · 数学 2016-05-20 Sungjin Kim

Let $\chi$ be a Dirichlet character modulo a prime~$p$. We give explicit upper bounds on $q_1<q_2<\dots<q_n$, the $n$ smallest prime nonresidues of $\chi$. More precisely, given $n_0$ and $p_0$ there exists an absolute constant…

数论 · 数学 2019-08-12 Shilin Ma , Kevin J. McGown , Devon Rhodes , Mathias Wanner

Let $\chi$ denote a primitive, non-quadratic Dirichlet character with conductor $q$, and let $L(s, \chi)$ denote its associated Dirichlet $L$-function. We show that $|L(1, \chi)| \geq 1/(9.12255 \log(q/\pi))$ for sufficiently large $q$, and…

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be Chebyshev's prime-counting function for primes congruent to $a$ modulo $q$. We show that under the assumption of an…

数论 · 数学 2025-09-15 Thomas Wright

It is proved that \[ \sum_{\chi \bmod q}N(\sigma , T, \chi) \lesssim_{\epsilon} (qT)^{7(1-\sigma)/3+\epsilon}, \] where $N(\sigma, T, \chi)$ denote the number of zeros $\rho = \beta + it$ of $L(s, \chi)$ in the rectangle $\sigma \leq \beta…

数论 · 数学 2025-07-14 Bin Chen

Let $f$ be a real-valued $1$-bounded multiplicative function. Suppose that the mean-value of $f^{2}$ exists, and $$\int_{0}^{1} \Big | \sum_{n \leq N} f(n)e^{2\pi i n \alpha} \Big | d \alpha\leq N^{o(1)}$$ as $N \rightarrow \infty$, then…

数论 · 数学 2025-10-24 Mayank Pandey , Maksym Radziwiłł

Burgess proved that for $\chi_q$ a primitive Dirichlet character modulo $q$ with $q$ cubefree, $\Big|\sum_{M< n\le M+N}\chi_q(n)\Big| \ll N^{1-\frac{1}{r}}q^{\frac{r+1}{4r^2}+\epsilon}$ for all integers $r\ge1.$ More recently, explicit…

In this paper, we prove a lower bound for $\underset{\chi \neq \chi_0}{\max}\bigg|\sum_{n\leq x} \chi(n)\bigg|$, when $x= \frac{q}{(\log q)^B}$. This improves on a result of Granville and Soundararajan for large character sums when the…

数论 · 数学 2020-05-26 Crystel Bujold

In this paper we obtain a new fully explicit constant for the P\'olya-Vinogradov inequality for primitive characters. Given a primitive character $\chi$ modulo $q$, we prove the following upper bound \begin{align*} \left| \sum_{1 \le n\le…

数论 · 数学 2020-01-16 Matteo Bordignon

Given a Dirichlet character $\chi$ modulo $q$ and its associated $L$-function, $L(s,\chi)$, we provide an explicit version of Burgess' estimate for $|L(s, \chi)|$. We use partial summation to provide bounds along the vertical lines $\Re{s}…

数论 · 数学 2022-06-24 Forrest J. Francis

Let $\chi$ be a real and non-principal Dirichlet character, $L(s,\chi)$ its Dirichlet $L$-function and let $p$ be a generic prime number. We prove the following result: If for some $0\leq \sigma<1$ the partial sums $\sum_{p\leq…

数论 · 数学 2021-02-23 Marco Aymone

For each nonprincipal Dirichlet character $\chi$, let $n_\chi$ be the least $n$ with $\chi(n) \notin \{0,1\}$. We show that as the average of $n_\chi$ over all nonprincipal characters $\chi$ modulo $q$ is $\ell(q) + o(1)$, where $\ell(q)$…

数论 · 数学 2014-02-26 Greg Martin , Paul Pollack

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be, as usual, Chebyshev's prime-counting function for the primes of the arithmetic progression $a$ (mod $q$) with $(a,q)=1$. For…

数论 · 数学 2024-11-26 Thomas Wright

We consider the size of large character sums, proving new lower bounds for the quantity $\Delta(N,q) = \sup_{\chi\neq \chi_0 mod q} |\sum_{n < N} \chi(n)|$ for almost all ranges of $N$. The results are proven using the resonance method and…

数论 · 数学 2014-01-14 Bob Hough

In this paper, we study the distribution of difference of multiplicative and additive characters modulo $p$ at consecutive polynomial values. More precisely, for an interval $I$ over finite field and $0<m<1$, we investigate the following…

数论 · 数学 2026-01-30 Nilanjan Bag , Dwaipayan Mazumder

A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.

综合数学 · 数学 2012-05-25 N. A. Carella

We study exponential sums whose coefficients are completely multiplicative and belong to the complex unit disc. Our main result shows that such a sum has substantial cancellation unless the coefficient function is essentially a Dirichlet…

数论 · 数学 2010-10-25 Leo Goldmakher

Let $\chi$ be a Dirichlet character (mod $n$) with conductor $d$. In a quite recent paper Zhao and Cao deduced the identity $\sum_{k=1}^n (k-1,n) \chi(k)= \varphi(n)\tau(n/d)$, which reduces to Menon's identity if $\chi$ is the principal…

数论 · 数学 2018-05-22 László Tóth

We consider Dirichlet $L$-functions $L(s, \chi)$ where $\chi$ is a real, non-principal character modulo $q$. Using Pintz's refinement of Page's theorem, we prove that for $q\geq 3$ the function $L(s, \chi)$ has at most one real zero $\beta$…

数论 · 数学 2018-12-03 Thomas Morrill , Tim Trudgian

We study the double character sum $\sum\limits_{\substack{m\leq X,\\m\odd}}\sum\limits_{\substack{n\leq Y,\\n\odd}}\leg mn$ and its smoothly weighted counterpart. An asymptotic formula with power saving error term was obtained by Conrey,…

数论 · 数学 2021-01-19 Martin Čech