🔢 mathematics

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

This paper introduces a discrete spectral framework based on cyclic graphs that approximates Dirichlet $L$ -functions via finite spectral sums, yielding exact combinatorial identities for their special values and offering a reformulation of the Generalized Riemann Hypothesis for odd primitive characters through an asymptotic functional equation.

Original authors: Anders Karlsson, Dylan Müller

Published 2026-05-18

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Anders Karlsson, Dylan Müller

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to measure the shape of a perfect, smooth circle. In the real world, you can't just grab a ruler and measure a curve perfectly; you have to approximate it. Usually, mathematicians do this by drawing a polygon with more and more sides (like a hexagon, then a 12-gon, then a 1,000-gon) until it looks like a circle. They take the limit as the number of sides goes to infinity to find the "true" answer.

This paper, by Anders Karlsson and Dylan Müller, proposes a clever twist on that idea. They suggest that sometimes, you don't need to wait for the polygon to become a perfect circle to get the exact answer. In fact, for certain mathematical puzzles involving "Dirichlet L-functions" (which are complex tools used to study prime numbers), the answer is already hidden inside a simple, small polygon.

Here is the breakdown of their discovery using everyday analogies:

1. The "Pixelated" Circle

Think of a standard circle as a smooth, continuous line. Now, imagine a "discrete" circle made of pixels or dots connected in a loop (like a digital clock face). The authors call this a cyclic graph, written as Z/nZ.

The Old Way: To find the value of a famous number like $\pi^2/6$ (which comes from the Riemann Zeta function), you usually have to sum up an infinite list of numbers. It's like trying to count every grain of sand on a beach to find the total weight.
The New Way: The authors show that you can build a "spectral" version of these numbers using just a few dots on a small loop. It's like realizing that if you count the trees in a small, specific forest, you can calculate the total biomass of the entire world's forests without ever leaving that small patch.

2. The "Asymptotic-to-Exact" Magic Trick

Usually, when you approximate a smooth curve with a jagged polygon, you get closer and closer to the truth as you add more sides, but you never quite hit the exact number until you reach infinity.

The authors discovered a "magic trick" where the approximation stops and becomes exact very early on.

The Analogy: Imagine you are walking toward a wall. Usually, you get 90% of the way there, then 99%, then 99.9%, and you never actually touch the wall.
Their Discovery: They found that for these specific mathematical problems, the "walking" stops at step 1 or step 2, and you are suddenly standing right against the wall. The formula that was supposed to be an approximation turns out to be the exact truth, even when the "polygon" is tiny.

This allows them to turn an infinite, messy sum into a simple, finite counting problem.

3. Counting Forests to Find $\pi$

One of the most surprising results is how they calculate these famous numbers.

The Metaphor: They show that the value of $\zeta(2)$ (which is $\pi^2/6$ ) can be found by simply counting "rooted spanning forests" on a tiny graph.
What is a "Rooted Spanning Forest"? Imagine a small group of islands (dots) connected by bridges. A "spanning forest" is a way of picking bridges so that every island is connected to at least one other, but there are no loops (no way to go in a circle and come back to where you started). A "rooted" one means you pick one island to be the "headquarters."
The Result: The paper claims that if you count how many ways you can arrange these bridges on a tiny loop of just 2 or 3 dots, that count contains the secret code to calculate $\pi^2/6$ . It's as if the answer to a cosmic question is hidden in the number of ways you can arrange a few Lego bricks.

4. The Riemann Hypothesis and the "Mirror"

The paper also tackles the Generalized Riemann Hypothesis (GRH), which is one of the biggest unsolved mysteries in math. It asks where the "zeros" (the points where the function equals zero) of these L-functions are located.

The Analogy: Imagine a song played on a piano. The GRH asks if all the notes that make the song "silent" (zero) are perfectly centered on a specific line.
The New View: The authors reformulate this problem using their discrete graphs. They suggest that if you look at the "discrete" version of the song (the graph version), the zeros will line up perfectly on that center line if and only if the "left side" of the song looks exactly like the "right side" as the graph gets larger.
They prove that for a specific type of character (called "odd"), checking if these discrete graphs behave symmetrically is the same as checking if the Riemann Hypothesis is true. It's like saying, "If the reflection in the mirror looks perfect, then the object itself is perfect."

5. Why This Matters (According to the Paper)

The authors don't claim this will cure diseases or build faster computers immediately. Instead, they claim to have found a new dictionary between two different languages of math:

The Language of Infinity: Infinite sums and smooth curves (Classical Analysis).
The Language of Counting: Finite graphs, trees, and forests (Combinatorics).

They show that these two languages are actually speaking the same thing. By translating a difficult infinite problem into a simple counting problem on a small graph, they can solve it exactly without needing to wait for "infinity."

In Summary:
The paper says: "We found a way to solve complex, infinite math problems by looking at tiny, finite loops of dots. We discovered that the answer isn't hidden in the limit of infinity, but is already written in the simple counting of tree-like structures on these small loops. This gives us a new, exact way to calculate famous numbers and a new way to test if the most famous unsolved math problem (the Riemann Hypothesis) is true."

Technical Summary: A Discrete Approach to Dirichlet L-functions, Their Special Values and Zeros

Problem Statement
The paper addresses the computation and structural understanding of special values and zeros of Dirichlet $L$ -functions, $L(s, \chi)$ , and the Riemann zeta function, $\zeta(s)$ . While these functions are classically defined via infinite Dirichlet series, the authors seek a discrete spectral framework that reveals a combinatorial structure underlying their special values. Specifically, the work aims to bridge the gap between continuous analytic number theory and discrete spectral graph theory, providing exact identities for special values without relying solely on limiting processes, and reformulating the Generalized Riemann Hypothesis (GRH) for odd characters in terms of asymptotic functional equations of discrete approximations.

Methodology
The authors develop a framework based on the spectral zeta functions of cyclic graphs $\mathbb{Z}/n\mathbb{Z}$ and their continuous counterparts, the circle $\mathbb{R}/\mathbb{Z}$ . The core methodology involves three main components:

Discrete Spectral Approximation: The classical Dirichlet series are approximated by finite spectral sums, denoted $L_n(s, \chi)$ , defined on cyclic graphs. For even characters, these sums involve the non-zero Laplace eigenvalues of the graph. For odd characters, a modified definition involving the cotangent function is used to avoid vanishing identities.
Refined Asymptotics: The authors employ a modified Euler–Maclaurin expansion, adapted for endpoint singularities by Sidi, to analyze the asymptotic behavior of these discrete sums as the graph size $n \to \infty$ . This expansion relates the discrete spectral zeta functions to the continuous Hurwitz zeta functions and Dirichlet $L$ -functions.
Structural Polynomiality: A crucial step is establishing that the discrete spectral zeta functions, when evaluated at integer arguments, exhibit a polynomial behavior in $n$ . By combining the asymptotic expansion (which terminates due to trivial zeros at negative integers) with this polynomiality, the authors demonstrate that the asymptotic expansions must coincide with exact finite- $n$ identities.

Key Contributions and Results

Asymptotic-to-Exact Principle: The paper establishes that asymptotic expansions of discrete spectral sums, derived for $n \to \infty$ , terminate at integer arguments to yield exact identities. This principle allows for the derivation of non-trivial closed formulas for special values at small $n$ (even $n=1$ ) from arguments designed for large $n$ .
Combinatorial Interpretation of Special Values: The authors provide a finite combinatorial interpretation for $\zeta(2n)$ and special values of Dirichlet $L$ -functions. These values are shown to be expressible in terms of the number of rooted spanning forests on cyclic graphs $\mathbb{Z}/n\mathbb{Z}$ . For instance, $\zeta(2)$ is derived from counting rooted spanning trees and forests on $\mathbb{Z}/2\mathbb{Z}$ .
New Recursive Identities: The framework produces infinite families of new recursive relations among special values. Specifically, for even Dirichlet characters $\chi$ and integers $m, n > 0$ , the paper derives identities linking $L(2k, \chi)$ to trigonometric sums. These generalize previous formulas obtained by Xie–Zhao–Zhao.
Exact Formulas for Trigonometric Sums: Theorem 1.2 provides exact formulas for sums of the form $\sum \sin^{-2m}(\pi(j+\theta)/n)$ and related cotangent sums, expressing them in terms of Hurwitz zeta functions and polynomials $a_k(s)$ .
Reformulation of the Generalized Riemann Hypothesis (GRH):
- For odd primitive characters, the paper establishes an equivalence between the GRH (all zeros in the critical strip lie on the line $\text{Re}(s) = 1/2$ ) and an asymptotic functional equation. Specifically, the hypothesis is equivalent to the condition that the ratio of the completed discrete functions $\xi_n(s, \chi)$ and $\xi_n(1-s, \chi)$ approaches 1 in modulus as $n \to \infty$ .
- This completes a "one-dimensional picture" of GRH reformulations, extending previous results for the Riemann zeta function and even characters.
Real Zeros and Heat Positivity: The paper investigates the absence of real zeros (Siegel zeros) in the critical strip. It introduces the concept of "heat positive" characters, where the heat kernel associated with the character remains non-negative. For real, even, primitive characters with the "positive mean property" (partial sums of the character are non-negative), the authors show the character is heat positive, implying $L(s, \chi) > 0$ for $0 < s < 1$ . This recovers Chowla's result for specific cases but frames it within the discrete heat equation context.

Significance and Claims
The paper claims to offer a unified spectral perspective that connects the analytic properties of $L$ -functions to the combinatorial geometry of graphs. Its primary significance lies in:

Exactness from Asymptotics: The discovery that asymptotic expansions for discrete spectral functions can yield exact identities for special values, bypassing the need for limits in certain contexts.
Combinatorial Realization: Providing a concrete combinatorial interpretation (rooted spanning forests) for classical special values like $\zeta(2n)$ , which were previously understood primarily through analytic continuation.
Completing the GRH Picture: By handling the case of odd primitive characters, the work completes a series of reformulations of the Riemann Hypothesis in terms of graph spectral asymptotics, covering both even and odd characters.
Discrete-Continuous Bridge: The methodology reinforces the connection between discrete Laplacians on graphs and continuous operators on manifolds, suggesting that graph zeta functions are not merely analogues but carry direct structural information about classical number-theoretic functions.

The authors maintain a modest stance regarding the elimination of real zeros; while they establish heat positivity for characters with the positive mean property, they acknowledge that ruling out real zeros for all characters remains an open challenge, though the discrete viewpoint offers a new avenue for investigation. The work does not propose new experimental applications but rather deepens the theoretical understanding of the interplay between spectral graph theory and analytic number theory.

1. The "Pixelated" Circle

2. The "Asymptotic-to-Exact" Magic Trick

3. Counting Forests to Find π\piπ

4. The Riemann Hypothesis and the "Mirror"

5. Why This Matters (According to the Paper)

More like this

3. Counting Forests to Find $\pi$