Computing Dirichlet character sums to a power-full modulus
From MaRDI portal
Abstract: The Postnikov character formula is used to express large portions of a Dirichlet character sum in terms of quadratic exponential sums. The quadratic sums are then computed using an analytic algorithm previously derived by the author. This leads to a power-saving if the modulus is smooth enough. As an application, a fast, and potentially practical, method to compute Dirichlet L-functions with complexity exponent 1/3 for smooth enough moduli is derived.
Recommendations
- A fast algorithm to compute \(L(1/2, f\times \chi_q)\)
- Estimates for character sums and Dirichlet \(L\)-functions to smooth moduli
- A fast amortized algorithm for computing quadratic Dirichlet \(L\)-functions
- On the character sums of polynomials and \(L\)-functions
- Numerical verification of Littlewood's bounds for \(|L(1,\chi)|\)
Cites work
- scientific article; zbMATH DE number 3115184 (Why is no real title available?)
- scientific article; zbMATH DE number 3968684 (Why is no real title available?)
- scientific article; zbMATH DE number 1542664 (Why is no real title available?)
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- scientific article; zbMATH DE number 818427 (Why is no real title available?)
- scientific article; zbMATH DE number 2206373 (Why is no real title available?)
- scientific article; zbMATH DE number 3228666 (Why is no real title available?)
- A fast algorithm to compute \(L(1/2, f\times \chi_q)\)
- A nearly-optimal method to compute the truncated theta function, its derivatives, and integrals
- An amortized-complexity method to compute the Riemann zeta function
- An approximate functional equation for Dirichlet L -functions
- Computing π(x): The Meissel-Lehmer Method
- Elementary thoughts on discrete logarithms
- Fast methods to compute the Riemann zeta function
- Numerics of analytic functions and complexity
- On prime numbers in an arithmetic progression with a prime-power difference
- On zeros of Dirichlet's L-series
- Primes in progressions to prime-power modulus
- Quadratic class numbers and character sums
- Rapid computation of \(L\)-functions for modular forms
Cited in
(8)- Computational Number Theory in Relation with L-Functions
- A fast amortized algorithm for computing quadratic Dirichlet \(L\)-functions
- Computing \(L\)-functions: a survey
- An alternative to Riemann-Siegel type formulas
- On the character sums moduloequal of the power prime number 2
- Zeros of partial sums of L-functions
- A fast algorithm to compute \(L(1/2, f\times \chi_q)\)
- An explicit hybrid estimate for \(L(1/2+it,\chi)\)
This page was built for publication: Computing Dirichlet character sums to a power-full modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401979)
