English
Related papers

Related papers: Computing Dirichlet character sums to a power-full…

200 papers

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

An algorithm to compute Dirichlet $L$-functions for many quadratic characters is derived. The algorithm is optimal (up to logarithmic factors) provided that the conductors of the characters under consideration span a dyadic window.

Number Theory · Mathematics 2016-12-20 Ghaith A. Hiary

For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a computable formula for evaluating the mean square sums $\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for any positive integer $r\geq 3$.…

Number Theory · Mathematics 2023-12-13 Neha Elizabeth Thomas , K Vishnu Namboothiri

In this paper, We use the Fourier series expansion of real variables function, We give a formula to calculate the Dirichlet character sum, and four special examples are given.

General Mathematics · Mathematics 2022-11-17 JinHua Fei

A description of the properties of \L with complex characters is given. By using these, together with the more familiar \L with real characters, it is shown how certain two dimensional lattice sums, which previously could not be put into…

Mathematical Physics · Physics 2009-11-13 I. J. Zucker , R. C. McPhedran

We survey a number of different methods for computing $L(\chi,1-k)$ for a Dirichlet character $\chi$, with particular emphasis on quadratic characters. The main conclusion is that when $k$ is not too large (for instance $k\le100$) the best…

Number Theory · Mathematics 2021-01-27 Henri Cohen

Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is…

Number Theory · Mathematics 2012-02-29 Pankaj Vishe

A method of estimating sums of multiplicative functions braided with Dirichlet characters is demonstrated, leading to a taxonomy of the characters for which such sums are large.

Number Theory · Mathematics 2012-08-02 P. D. T. A. Elliott , Jonathan Kish

To obtain the Dirichlet series for complex powers of the Riemann zeta function, we define and study the basic properties of a sequence of polynomials that, used as coefficients of the respective terms of the Dirichlet series of the Riemann…

Number Theory · Mathematics 2021-04-14 Winston Alarcón Athens

We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…

Number Theory · Mathematics 2020-03-27 Samuel Porritt

We consider a sum of the derivatives of Dirichlet $L$-functions over the zeros of Dirichlet $L$-functions. We give an asymptotic formula for the sum.

Number Theory · Mathematics 2021-06-04 Hirotaka Kobayashi

We show that certain sums studied in two recent papers are basically character coordinates (as they are called in the literature). These sums involve values of Dirichlet characters and powers of $\cot(\pi k/n)$, $1\le k\le n-1$. We also…

Number Theory · Mathematics 2025-04-17 Kurt Girstmair

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

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

In their recent work, the authors (2016) have combined classical ideas of A. G. Postnikov (1956) and N. M. Korobov (1974) to derive improved bounds on short character sums for certain nonprincipal characters with powerful moduli. In the…

Number Theory · Mathematics 2018-02-01 William D. Banks , Igor E. Shparlinski

This paper introduces a symbolic calculus-based approach for deriving closed-form expressions for the sums of arithmetic sequences. The method extends beyond constant-difference sequences to those with polynomially increasing steps,…

General Mathematics · Mathematics 2025-11-19 Ahmed Abdalmuhsin Abdalsahib

Given $c,$ a positive integer, we give an explicit formula and an asymptotic formula for \[ \sum\chi(c)|L(1,\,\chi)|^{2}, \] where $\chi$ is the non-trivial Dirichlet character mod $f$ with $f>c.$

Number Theory · Mathematics 2016-05-02 Seok Hyeong Lee , Seungjai Lee

We describe a complete algorithm to compute millions of coefficients of classical modular forms in a few seconds. We also review operations on Euler products and illustrate our methods with a computation of triple product L-function of…

Symbolic Computation · Computer Science 2025-07-10 Pascal Molin

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

Let $M=M_1 M_2 M_3$ be the product of three distinct primes and let $\chi=\chi_1 \chi_2 \chi_3$ be a Dirichlet character of modulus $M$ such that each $\chi_i$ is a primitive character modulo $M_i$ for $i=1,2,3$. In this paper, we provide a…

Number Theory · Mathematics 2014-09-15 Roman Holowinsky , Ritabrata Munshi , Zhi Qi
‹ Prev 1 2 3 10 Next ›