A discrete approach to Dirichlet L-functions, their special values and zeros

Abstract

We develop a discrete spectral framework for Dirichlet L-functions that reveals a combinatorial structure underlying their special values and connects this to their zeros. Our approach approximates the classical Dirichlet series by finite spectral sums Ln(s,χ) associated with cyclic graphs Z/nZ and studies their asymptotics as n→ ∞. Combining a refined Euler Maclaurin expansion with a structural polynomiality property, we show that at integer arguments the asymptotic expansions terminate and yield exact identities. This asymptotic to exact principle produces new infinite families of relations among special values of Dirichlet L-functions and recovers, by a different mechanism, formulas previously obtained by Xie, Zhao and Zhao. An interesting feature of our method is that ζ(2n) and the corresponding special values for all Dirichlet L-functions thereby admit a finite combinatorial interpretation in terms of rooted spanning forests on any fixed cyclic graph. Concerning zeros, the same framework leads to some remarks about real zeros and a reformulation of the Generalized Riemann Hypothesis in the case of odd primitive characters in terms of an asymptotic functional equation relating ξn(1-s,χ) to ξn(s,χ) of the completed discrete functions. This establishes the remaining case of the one dimensional picture obtained in earlier works.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…