🔢 mathematics

The Riemann Hypothesis in Oaxaca

This paper proposes an equivalence of the Riemann Hypothesis that connects the classical asymptotic threshold of the sum-of-divisors function to combinatorial limiting proportions within the Young lattice of integer partitions.

Original authors: Carlos Segovia

Published 2026-02-04

📖 5 min read🧠 Deep dive

CC0 1.0

Original authors: Carlos Segovia

Original paper dedicated to the public domain under CC0 1.0 (http://creativecommons.org/publicdomain/zero/1.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 solve the ultimate puzzle of mathematics: the Riemann Hypothesis. For over 150 years, mathematicians have been staring at a mysterious map of numbers (the "zeros" of a special function) and guessing that they all line up on a perfect, straight highway. If they do, it unlocks secrets about how prime numbers are distributed. If they don't, the whole structure of number theory might crumble.

This paper, written by Carlos Segovia from Oaxaca, Mexico, tries to build a bridge between this abstract highway and a very concrete, visual playground called the Young Lattice. Think of the Young Lattice as a giant, infinite set of Lego blocks where you build shapes (called "partitions") by stacking numbers on top of each other.

Here is the story of the paper, broken down into simple, everyday concepts:

1. The "Too Many Divisors" Problem

The paper starts with a rule established by a mathematician named Robin. He said: "If the Riemann Hypothesis is true, then for any number bigger than 5,040, the sum of its divisors (the numbers that divide into it evenly) cannot get too big."

Imagine you have a jar of marbles (a number). You want to know how many "friends" (divisors) it has. Robin says, "If the Riemann Hypothesis is true, the total weight of all these friends can never exceed a specific limit, which looks like a formula involving the number itself and a double logarithm."

2. The New Bridge: Turning Numbers into Lego Shapes

Segovia's main idea is to translate this "sum of divisors" rule into the language of Lego shapes (integer partitions).

The Old Way: You look at a number, list its divisors, and add them up.
The New Way: You look at the number as a collection of Lego blocks. You arrange them in specific patterns (partitions) and calculate a "score" based on how you stack them.

The author defines a special score, let's call it A(n). He claims that if the Riemann Hypothesis is true, this Lego-score A(n) must stay below a certain ceiling. If the hypothesis is false, the Lego-score would eventually explode and break through the ceiling.

3. The "Assembly" of the Score

To calculate this score, the author uses a "construction kit" involving:

Symmetric Polynomials: Think of these as recipes that mix different ingredients (numbers) together in every possible way.
Permutations and Cycles: Imagine shuffling a deck of cards. The author looks at how many "loops" or "cycles" you can form with the cards.
Determinants: These are like complex spreadsheets or grids of numbers that, when solved, give you a single value representing the structure of the Lego shape.

The paper shows that the total score A(n) is actually the sum of many smaller pieces (sub-summands), each corresponding to a different type of Lego shape.

4. The "Almost There" Moment

The author does a lot of heavy math to calculate what happens to these Lego scores as the numbers get infinitely large.

He calculates the contribution of the "simplest" shapes (like a single line of blocks).
He calculates the contribution of slightly more complex shapes (like a line with a small branch).

The Result: When he adds up the contributions of the shapes he can calculate, the total comes out to about 1.6359.

The Problem: The "ceiling" set by the Riemann Hypothesis is actually 1.7810.

The author admits: "I have built a bridge, but it only reaches 1.6359. It hasn't quite reached the 1.7810 mark yet."

5. The Missing Pieces

Why is there a gap? The author explains that he only calculated the scores for the "simple" Lego shapes (like a single line or a line with one branch). He hasn't fully accounted for the weird, complex shapes (like a square block or a T-shape).

He suggests that if you add the scores from these missing, complex shapes, the total might finally reach the 1.7810 limit, proving the hypothesis. However, he admits he hasn't proven how those missing pieces fit in yet.

6. The "Divisor Map" Analogy

In the final section, the author looks at specific, super-powerful numbers (called "colossally abundant numbers"). He tries to map out where the divisors of these numbers sit.

He proposes a theory: For these super-numbers, the divisors are packed so tightly that they behave in a very predictable way, almost like a ruler marked with a specific constant (related to the number 0.577, known as Euler's constant). He suggests that proving the Riemann Hypothesis might require showing that these divisors fit perfectly into a specific "slot" on this ruler.

Summary

The Goal: Prove the Riemann Hypothesis by showing that the "sum of divisors" for large numbers never gets too big.
The Method: Translate this math problem into a game of stacking Lego blocks (partitions) and calculating a score.
The Discovery: The author successfully calculated the score for the "simple" Lego blocks and found it is close to the limit, but not quite there.
The Conclusion: The paper provides a new, beautiful way to look at the problem using combinatorics (counting and arranging), but it leaves the final step (accounting for the complex Lego shapes) as an open challenge for future mathematicians.

In short, the author built a beautiful, partial bridge to the Riemann Hypothesis. It's a solid structure, but there's still a gap to cross before we can walk all the way to the other side.

Technical Summary: "The Riemann Hypothesis in Oaxaca"

Problem Statement
The paper addresses the Riemann Hypothesis (RH) by seeking a direct bridge between the analytic properties of the Riemann zeta function and the combinatorial structure of the Young lattice. Specifically, it investigates the asymptotic behavior of the sum-of-divisors function, $\sigma(n)$ . The central problem is to establish an equivalence between the RH and specific inequalities involving $\sigma(n)$ , and to interpret these inequalities through the lens of integer partitions and symmetric polynomials. The paper builds upon established equivalences by Robin and Lagarias, which relate RH to the bounds of $\sigma(n)$ relative to $n \log \log n$ and harmonic numbers $H_n$ .

Methodology
The author employs a multi-faceted approach combining analytic number theory, combinatorics, and probabilistic interpretations of permutation cycles:

Analytic Equivalence: The paper utilizes an inequality proposed by Espinosa involving a series $A(n) = \sum_{k=0}^{\infty} a_k \frac{(H_n)^k}{k!}$ , where coefficients $a_k$ are bounded by $H_k - \gamma$ and $\log(k) + 1/k$ . The author sketches a proof showing that the validity of $\sigma(n) \leq A(n)$ is equivalent to the RH. This involves deriving contradictions by assuming the RH is false (implying $\sigma(n)$ exceeds specific bounds infinitely often) and comparing these against asymptotic expansions of $A(n)$ .
Combinatorial Decomposition: The function $A(n)$ is decomposed into a sum of sub-components $A_r(n)$ derived from the "assembly theorem" for monomial symmetric polynomials. These components are linked to partitions of integers.
Probabilistic Interpretation: The elementary symmetric polynomials $e_m(n)$ evaluated at $x_i = 1/i$ are interpreted probabilistically as related to the number of cycles in a random permutation of $n+1$ elements. This allows the author to express sums involving logarithms of divisors in terms of expected values of functions of the cycle count $C_{n+1}$ .
Asymptotic Analysis: Using the cumulants of the cycle count distribution (related to Stirling numbers of the second kind) and Bell polynomials, the author derives asymptotic expansions for the expected values $E_j$ . These are used to calculate the limiting proportions $\rho_r = \lim_{n \to \infty} \frac{\tilde{A}_r(n)}{n \log \log n}$ .

Key Contributions and Results

Sketch of Proof for Espinosa's Equivalence: The paper provides a detailed sketch proving that the inequality $\sigma(n) \leq A(n)$ (with specific bounds on coefficients $a_k$ ) is equivalent to the Riemann Hypothesis. The proof demonstrates that if RH fails, the growth of $\sigma(n)$ would eventually violate the upper bounds derived from the asymptotic behavior of $A(n)$ .
Combinatorial Interpretation of Thresholds: The paper establishes that the classical threshold $\lim_{n \to \infty} \frac{\sigma(n)}{n \log \log n} = e^\gamma$ admits a combinatorial interpretation via limiting proportions associated with families of integer partitions.
Calculation of Limiting Proportions ( $\rho_r$ ): The author derives explicit formulas for the limiting proportions of the partition-based sums:
- $\rho_1 = 1$
- $\rho_2 = 1/2$
- For $r \geq 2$ , $\rho_r = \frac{1}{r!} \left[ (-1)^r + \sum_{j=3}^r (-1)^{r+j} \zeta(j-1) \right]$ .
Numerical Discrepancy and Correction Terms: A significant result is the calculation of the partial sum of these proportions. The sum of the first ten $\rho_r$ $ρ_{r}$ terms converges to approximately $1.6359$. The paper notes a strict inequality: $1.6359 < e^\gamma \approx 1.7810$ $1.6359 < e^{γ} \approx 1.7810$ .
- The author attributes this gap to the exclusion of partitions that are not of the form $[r, 1^l]$ (e.g., partitions like $[2, 2]$ or $[3, 2]$ ).
- The paper defines correction terms $R_r(n)$ for these missing partitions and provides a formula for the case $r=3$ (associated with partition $[2, 2]$ ).
Divisor Enumeration Hypothesis: The paper speculates on the arrangement of divisors for highly abundant numbers. It proposes that for colossally abundant numbers, the largest divisor $d^{(1)}(n)$ satisfying a specific sum condition is approximately $\lceil \gamma \log n \rceil$ . The author states that a proof of RH in this direction must establish this inequality as a first step.

Significance and Claims
The paper claims to offer a "direct bridge" between the Riemann Hypothesis and the Young lattice, suggesting that the truth of RH is encoded in the limiting proportions of specific families of integer partitions.

The author is modest regarding the completeness of the combinatorial derivation. The paper explicitly acknowledges that the calculated sum of proportions ( $\approx 1.6359$ ) does not yet reach the required threshold ( $e^\gamma \approx 1.7810$ ). The significance of the work lies in identifying the specific structural components (partitions of non- $[r, 1^l]$ forms) that account for the missing mass in the limit. The paper concludes that while the connection is established for specific partition families, a full proof requires understanding the contribution of the remaining partition types and verifying the divisor enumeration hypothesis for colossally abundant numbers. The work remains a sketch and a proposal of direction rather than a complete resolution of the hypothesis.