← Latest papers
🔢 mathematics

The Second Moment of Rankin-Selberg LL-Functions in Conductor-Dropping Regimes

This paper establishes an asymptotic formula for the second moment of Rankin-Selberg LL-functions associated with the convolution of two holomorphic Hecke cusp forms of equal weight within conductor-dropping regimes.

Original authors: Peter Humphries, Rizwanur Khan

Published 2026-07-27
📖 5 min read🧠 Deep dive

Original authors: Peter Humphries, Rizwanur Khan

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 a vast, invisible library where every book is a secret code governing the rhythm of numbers. This is the world of analytic number theory, a branch of mathematics that treats numbers like musical notes, searching for hidden harmonies in their distribution. At the heart of this library are special functions called L-functions. Think of an L-function as a unique fingerprint for a specific pattern of numbers; it encodes deep information about how those numbers behave. Mathematicians are obsessed with the "central point" of these functions—a specific spot on the number line where the function's value holds the key to some of the universe's most stubborn puzzles, like the famous Riemann Hypothesis.

To understand these fingerprints, mathematicians often look at them in groups, or "families." They ask: if we take a whole choir of these L-functions and measure their combined volume (their "moment"), what does the sound look like? Usually, the louder the choir, the more predictable the sound. But sometimes, the choir is arranged in a tricky way where the volume drops unexpectedly. This is called a "conductor-dropping" regime. It's like trying to predict the sound of a choir where the singers are whispering in a way that cancels out the usual noise, making the math incredibly difficult to untangle. Solving these puzzles isn't just about satisfying curiosity; it helps mathematicians prove how "loud" or "quiet" these number patterns can get, which is crucial for understanding the fundamental structure of mathematics itself.


In their paper, Peter Humphries and Rizwanur Khan tackle one of these tricky "whispering choir" scenarios. They focus on a specific family of L-functions created by combining two special types of number patterns (called holomorphic Hecke cusp forms) that have the same weight, or "size." Usually, when you mix two patterns of the same size, the resulting "volume" (the analytic conductor) is huge. But in this specific case, because the two patterns are identical in weight, the volume drops significantly. This drop makes the math behave differently than expected, creating a fog that has kept mathematicians from seeing the full picture.

The authors set out to find an "asymptotic formula," which is essentially a precise recipe for predicting the total volume of this choir as it gets larger. They wanted to know: if we add up the squared volumes of all these L-functions, what is the main term that dominates the sum, and how big is the leftover "noise" (the error term)?

The paper proves that they can find this recipe, but with a catch. They successfully derive a formula that gives the main term, which turns out to be a positive value growing roughly like k(logk)2k(\log k)^2 (where kk is the weight of the forms). This main term is a complex polynomial involving logarithms and values of other L-functions. However, the paper explicitly states that obtaining a "power-saving" error term (where the noise is significantly smaller than the main term) seems out of reach unless one already has available subconvex bounds for related L-functions that are currently unknown. In simpler terms, they can hear the main melody clearly, but the background static is still too loud to be ignored completely. They managed to reduce the static to a level that saves a "logarithmic" amount, but the full "power" of the size needed to solve the hardest related problems immediately remains elusive.

The authors also argue against the idea that this problem is easy to solve using standard tricks. While one might expect that because the "volume" of the family is small, the math would be straightforward, the paper shows that the usual heuristics are misleading in these conductor-dropping settings. They demonstrate that getting a perfect, clean answer (with a power-saving error term) would likely require solving other, even harder problems first—specifically, finding better bounds for related L-functions that are currently out of reach.

To crack the code, the authors used a clever mathematical "magic trick." Instead of just crunching numbers, they translated the problem into the language of geometry and waves. They viewed the sum of these L-functions as an integral (a way of measuring area under a curve) involving special wave patterns on a curved surface. By using a tool called the "Watson–Ichino triple product formula," they could turn this geometric integral into a sum of L-functions. This allowed them to separate the "main melody" from the "noise."

One of the most delicate parts of their work was proving that the main melody is actually louder than the noise. The main term they found involves a value called L(1,ad g)L(1, \text{ad } g), which is known to be very small (it can be as small as 1/logk1/\log k). The authors had to show that despite this smallness, the main term still dominates the error. They did this by exploiting a "hidden structure" in the formula, showing that the positive parts of the main term are strong enough to overcome the negative parts, ensuring the total result is positive and significant for large kk.

In summary, Humphries and Khan have provided the first clear asymptotic formula for this specific second moment in a conductor-dropping regime. They have identified the main term and bounded the error, but they stop short of claiming a full solution to the subconvexity problem. Their work is a significant step forward, proving that the "whispering choir" does have a predictable structure, even if the background static remains just a little too loud to silence completely. They have mapped the terrain, showing exactly where the obstacles lie, but the final climb to the summit of a power-saving bound remains a challenge for the future.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →