2000 character limit reached
Computing Dirichlet character sums to a power-full modulus
Published 21 May 2012 in math.NT | (1205.4687v5)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.