English
Related papers

Related papers: Sharp bounds for maximal sums of odd order Dirichl…

200 papers

For any given integer $k\geq 2$ we prove the existence of infinitely many $q$ and characters $ \chi\pmod q$ of order $k$, such that $|L(1,\chi)|\geq (e^{\gamma}+o(1))\log\log q$. We believe this bound to be best possible. When the order $k$…

Number Theory · Mathematics 2019-02-20 Youness Lamzouri

We establish that three well-known and rather different looking conjectures about Dirichlet characters and their (weighted) sums, (concerning the P\'{o}lya-Vinogradov theorem for maximal character sums, the maximal admissible range in…

Number Theory · Mathematics 2021-12-24 Andrew Granville , Alexander P. Mangerel

For a primitive Dirichlet character $\chi\pmod q$ we let \[M(\chi):= \frac{1}{\sqrt{q}}\max_{1\leq t \leq q} \Big|\sum_{n \leq t} \chi(n) \Big|.\] In this paper, we investigate the distribution of $M(\chi)$, as $\chi$ ranges over primitive…

Number Theory · Mathematics 2024-10-30 Youness Lamzouri , Kunjakanan Nath

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…

Number Theory · Mathematics 2014-02-26 Xuancheng Shao

Let $S_n$ denote a symmetric group, $\chi$ an irreducible character of $S_n$, and $g\in S_n$ an element which decomposes into $k$ disjoint cycles, where $1$-cycles are included. Then $|\chi(g)|\le k!$, and this upper bound is sharp for…

Representation Theory · Mathematics 2024-11-14 Michael Larsen

We establish new estimates on short character sums for arbitrary composite moduli with small prime factors. Our main result improves on the Graham-Ringrose bound for square free moduli and also on the result due to Gallagher and Iwaniec…

Number Theory · Mathematics 2014-05-09 Mei-Chu Chang

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…

Number Theory · Mathematics 2020-05-26 Crystel Bujold

Given a non-principal Dirichlet character chi mod q, an important problem in number theory is to obtain good estimates for the size of L(1,chi). In this paper we focus on sharpening the upper bounds known for |L(1,chi)|; in particular, we…

Number Theory · Mathematics 2007-05-23 Andrew Granville , Kannan Soundararajan

We give an explicit version of a result due to D. Burgess. Let $\chi$ be a non-principal Dirichlet character modulo a prime $p$. We show that the maximum number of consecutive integers for which $\chi$ takes on a particular value is less…

Number Theory · Mathematics 2010-11-22 Kevin J. McGown

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

Number Theory · Mathematics 2025-09-12 Zikang Dong , Yutong Song , Weijia Wang , Hao Zhang , Shengbo Zhao

Let $L(s,\chi)$ be the Dirichlet $L$-function associated to a non trivial primitive Dirichlet character $\chi$ defined $\bmod\ q$, where $q$ is an odd prime. In this paper we introduce a fast method to compute $\vert L(1,\chi) \vert$ using…

Number Theory · Mathematics 2021-02-17 Alessandro Languasco

We use the large sieve inequality for smooth numbers due to S. Drappeau, A. Granville and X. Shao (2017), together with some other arguments, to improve their bounds on the frequency of pairs $(q,\chi)$ of moduli $q$ and primitive…

Number Theory · Mathematics 2017-06-13 Igor E. Shparlinski

In the present note, we prove new lower bounds on large values of character sums $\Delta(x,q):=\max_{\chi \neq \chi_0} \vert \sum_{n\leq x} \chi(n)\vert$ in certain ranges of $x$. Employing an implementation of the resonance method…

Number Theory · Mathematics 2018-05-21 Marc Munsch

Let $\chi$ be a non-principal Dirichlet character of modulus $q$ with associated \textit{L}-function $L(s,\chi)$. We prove that $$|L(1,\chi)|\le\left(\frac{1}{2}+O\Big(\frac{\log\log q}{\log q}\Big)\right)\frac{\varphi(q)}{q}\log q\,,$$…

Number Theory · Mathematics 2025-03-11 Jeffery Ezearn

For any large prime $q$, $1 \leq x \leq q$ and any real $0 \leq k \leq 1$, we prove an upper bound for the following $2k$-th moment $$\displaystyle \sum_{\substack{\chi \bmod q}} \Big| \sum_{n\leq x} \chi(n)\lambda(n)\Big|^{2k},$$ where…

Number Theory · Mathematics 2025-12-08 Peng Gao , Xiaosheng Wu

This paper improves the upper bound for the exceptional zeroes of Dirichlet L-functions with even characters. The result is obtained by improving on explicit estimate for $L'(\sigma;\chi)$ for $\sigma$ close to unity, using a result on the…

Number Theory · Mathematics 2019-07-22 Matteo Bordignon

Let $\chi$ be a primitive Dirichlet character of conductor $q$ and $L(z,\chi)$ the associated L-series. In this paper we provide an explicit upper bound for $|L(1, \chi)|$ when 3 divides $q$.

Number Theory · Mathematics 2013-06-21 Sumaia Saad Eddin , David J. Platt

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

Let $\mathfrak{q}>2$ be a prime number, $\chi$ a primitive Dirichlet character modulo $\mathfrak{q}$ and $f$ a primitive holomorphic cusp form or a Hecke-Maass cusp form of level $\mathfrak{q}$ and trivial nebentypus. We prove the subconvex…

Number Theory · Mathematics 2020-05-19 Qingfeng Sun , Hui Wang

We use the $q$-analogue of van der Corput's method to estimate short character sums to smooth moduli. If $\chi$ is a primitive Dirichlet character modulo a squarefree, $q^\delta$-smooth integer $q$ we show that $$L(\frac12,\chi)\ll_\epsilon…

Number Theory · Mathematics 2015-03-25 A. J. Irving