A computable formula for evaluating the mean square sum of $L$-functions
Neha Elizabeth Thomas, K Vishnu Namboothiri

TL;DR
This paper provides a new computable formula for evaluating the mean square sums of Dirichlet L-functions at positive integers and relates it to sums involving sine functions, Bernoulli numbers, and binomial coefficients.
Contribution
It introduces a novel, explicit formula for the mean square sums of Dirichlet L-functions for moduli greater than or equal to 3, and an inductive method for related sine sums.
Findings
Explicit formula for mean square sums of L-functions at integer points
Inductive formula for sine sums involving Bernoulli numbers
Connections established between L-functions and trigonometric sums
Abstract
For Dirichlet characters mod where , we here give a computable formula for evaluating the mean square sums for any positive integer . We also give an inductive formula for computing the sum where is a positive integer in terms of Bernoulli numbers and binomial coefficients.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Benford’s Law and Fraud Detection · Mathematical and Theoretical Analysis
