🔢 mathematics

Gain Bounds for Diagonal Superelliptic Equations under the Strong ABC Conjecture

This paper establishes a framework for bounding power and approximation gains in diagonal superelliptic equations, demonstrating their predisposition to high ABC-qualities and using the Strong ABC conjecture to exclude solutions for $n \ge 4$ while validating these bounds against historical high-quality ABC triples.

Original authors: Karsten Müller

Published 2026-02-24

📖 5 min read🧠 Deep dive

CC0 1.0

Original authors: Karsten Müller

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 a detective trying to solve a very specific, ancient puzzle involving numbers. This paper, written by Karsten Müller, is like a new rulebook for that detective, explaining why certain number combinations are impossible to find, even though they seem like they should exist.

Here is the story of the paper, broken down into simple concepts and everyday analogies.

1. The Puzzle: The "Superelliptic" Equation

The paper looks at a specific type of math equation: $By^n = Ax^n + k$ .

The Analogy: Imagine a balance scale. On one side, you have a heavy weight ( $By^n$ ). On the other side, you have a slightly lighter weight ( $Ax^n$ ) plus a tiny pebble ( $k$ ).
The Goal: You want to find whole numbers for $x$ , $y$ , and the coefficients ( $A, B$ ) that make the scale balance perfectly.
The Catch: The numbers $x$ and $y$ must be at least 2 (no trivial tricks like using 1), and the "pebble" $k$ is usually very small.

2. The Detective's Tools: "Gains" and "Quality"

To solve this, the author invents two measuring tools to see how "efficient" a solution is. Think of these as measuring how much "bang for your buck" a solution gets.

The "Approximation Gain" ( $G_a$ ): This measures how well the two sides of the equation match up relative to the size of the numbers used.
- Analogy: Imagine you are trying to fill a swimming pool with a bucket. $G_a$ measures how much water you actually get into the pool compared to how many times you had to walk back to the well. A high score means you are very efficient.
The "Power Gain" ( $G_p$ ): This measures how many "prime building blocks" (factors) are hidden inside the numbers.
- Analogy: Imagine the numbers are made of Lego bricks. $G_p$ asks: "How many bricks did you use to build this huge tower?" If you built a massive tower using very few, simple bricks, that's a high "Power Gain."

The "ABC Quality" ( $q$ ): This is the final score. It's the product of the two gains above ( $q = G_a \times G_p$ ). It tells us how "special" a solution is.

3. The Big Rule: The ABC Conjecture

The paper relies on a famous, unproven idea in math called the ABC Conjecture.

The Rule: There is a "speed limit" for how special a solution can be. You can't have a solution that is too efficient (too high a $q$ score).
The "Strong" Version: The author assumes an even stricter speed limit (called the "Ultra-Strong" version), saying the score $q$ can never be higher than 1.5.

4. The Main Discovery: The "Structural Trap"

The author's big breakthrough is realizing that the shape of the equation itself creates a trap.

The Trap: Because the equation involves powers (like $x^2$ , $x^3$ , etc.), the numbers grow very fast. This forces the "Approximation Gain" ( $G_a$ ) to be naturally high.
The Consequence: Since the total score ( $q$ ) is capped by the ABC Conjecture, and the "Approximation Gain" is forced to be high by the equation's shape, the "Power Gain" ( $G_p$ ) is forced to be low.
The Metaphor: Imagine a seesaw. The ABC Conjecture puts a heavy weight on one end (the total score limit). The equation's shape pushes down hard on the other end (the Approximation Gain). This forces the middle part (the Power Gain) to stay low. You simply cannot have a solution that is both highly efficient and uses complex, "smooth" numbers.

5. What This Means for Solving the Puzzle

The author uses this logic to prove that for certain types of equations, no solutions exist at all.

The "No-Go" Zone: If you set the pebble $k=1$ (the smallest possible pebble) and look at high powers (like $n=4, 5, 6...$ ), the math proves that the "Approximation Gain" would have to be so high that it breaks the ABC speed limit.
The Result: Therefore, for equations like $y^n = x^n + 1$ where $n \ge 4$ , there are no solutions. The universe of numbers simply doesn't allow them.

6. Checking the Theory: The "Hall of Fame"

To make sure his new rulebook works, the author checks it against the most famous, high-scoring solutions found by other mathematicians (Reyssat, de Weger, Nitaj).

The Test: He plugs these famous solutions into his new formulas.
The Result: The formulas hold up perfectly. The famous solutions fit right inside the "speed limit" zones he calculated.
The Twist: He found that one famous solution (by Nitaj) only works because it cheats by using $x=1$ . If you force $x$ to be at least 2 (a non-trivial solution), that specific "cheat" disappears, and the math holds firm. This proves that the condition "x must be at least 2" is crucial for the rules to work.

Summary: The Takeaway

Karsten Müller has built a new mathematical fence. He showed that the shape of these specific equations naturally pushes them toward a "high quality" state. But because the universe (via the ABC Conjecture) has a strict speed limit on how high that quality can go, the equations are forced to behave in a very specific way.

In plain English:

"Because the equation grows so fast, it demands a lot of 'efficiency.' But the universe says, 'You can't be that efficient.' Therefore, for big powers, the equation simply cannot be solved. We have mathematically proven that these specific puzzles have no answer."

This gives mathematicians a powerful new way to say "No" to impossible equations without having to check every single number in the universe.

1. Problem Statement

The paper addresses the problem of establishing uniform bounds for solutions to generalized diagonal superelliptic equations of the form:
$By^n = Ax^n + k$
where $x, y \geq 2$ , $n \geq 2$ , $A, B \geq 1$ , $k \geq 1$ , and $\gcd(Ax, By, k) = 1$ .

The core objective is to analyze the ABC-quality ( $q$ ) of the associated coprime triples $(Ax^n, k, By^n)$ and derive theoretical limits for two specific metrics:

Approximation Gain ( $G_a$ ): A measure of how well the logarithmic size of the terms approximates the logarithmic size of the product of coefficients and variables.
Power Gain ( $G_p$ ): A measure of the ratio between the logarithmic size of the product and the logarithmic size of the radical of the product.

The paper investigates whether these gains are bounded under the Strong ABC Conjecture, specifically testing the numerical observations that $G_a < 1.5$ and $G_p < 3$ for non-trivial solutions.

2. Methodology

The author employs a structural analysis approach combined with the Strong ABC Conjecture. The methodology involves:

Redefinition of Metrics: The paper introduces modified definitions for $G_a$ $G_{a}$ and $G_p$ $G_{p}$ (slightly different from previous work by de Weger) to ensure strict inequalities hold for the generalized equation.
- $G_a = \frac{\ln(\max(Ax^n, By^n))}{\ln(xyABk)}$
- $G_p = \frac{\ln(xyABk)}{\ln(\text{rad}(xyABk))}$
- $q = G_a \cdot G_p$
Structural Derivation: Instead of relying solely on conjectures, the author derives a purely structural lower bound for $G_a$ based on the equation's parameters ( $n, A, B, y$ ). This bound is independent of the ABC conjecture.
Synthesis with ABC Conjecture: By combining the structural lower bound of $G_a$ $G_{a}$ with the assumed upper bound of the ABC quality ( $q < q_{max}$ $q < q_{ma x}$ ), the author derives an upper bound for the Power Gain ( $G_p$ ).
- Logic: Since $G_p = q / G_a$ , if $q$ is bounded and $G_a$ has a structural minimum, $G_p$ must have a structural maximum.
Case Validation: The theoretical bounds are tested against high-quality historical ABC triples (Reyssat, de Weger, Nitaj) to verify sharpness and the necessity of constraints (specifically $x \geq 2$ ).

3. Key Contributions

A. Structural Lower Bound for Approximation Gain ( $G_a$ )

The paper establishes Theorem 1, proving that for any solution with $y \geq 2$ and $By^n > Ax^n$ :
$G_a > \frac{1}{\frac{n+2}{n} + \frac{(n-1)\ln(AB)}{n(n \ln y + \ln B)}}$
This demonstrates that superelliptic equations are "inherently predisposed" to high ABC qualities because the exponential structure forces $G_a$ to be non-negligible.

B. Uniform Bounds for Power Gain ( $G_p$ )

Under the assumption of the Strong ABC Conjecture ( $q < q_{max}$ ), the paper derives Theorem 2, providing a uniform upper bound for $G_p$ :
$G_p < \frac{q_{max}}{G_{a, \min}}$
This provides a theoretical foundation for the numerical observation that $G_p < 3$ for $n=2$ under the Ultra-Strong conjecture ( $q < 1.5$ ).

C. Non-Existence Results for $k=1$

The paper proves Theorem 4, showing that for the equation $y^n = x^n + 1$ (where $k=1$ ), the quality $q$ satisfies $q > n/2$ .

Implication: If the Strong ABC conjecture holds with $q < 2$ , then $n/2 < 2 \implies n < 4$ .
Result: No solutions exist for $n \geq 4$ under $q < 2$ . Under the Ultra-Strong conjecture ( $q < 1.5$ ), no solutions exist for $n \geq 3$ .

D. The Critical Role of Non-Triviality ( $x \geq 2$ )

A significant contribution is the distinction between trivial ( $x=1$ ) and non-trivial ( $x \geq 2$ ) solutions.

The paper analyzes the Nitaj triple (1993), which has $x=1$ . It shows that when $x=1$ , the coefficient $A$ can absorb the logarithmic volume, allowing $G_p$ to exceed the bound of 3.0 (calculated $G_p \approx 3.27$ ).
This proves that the conjecture $G_p < 3$ is only valid for non-trivial solutions ( $x \geq 2$ ).

4. Key Results and Validation

Reyssat Triple (1987):
- Equation: $2 + 3^{10} \cdot 10^9 = 23^5$ (interpreted as $n=5$ ).
- Result: $G_a \approx 1.46$ (validating the $<1.5$ bound) and $G_p \approx 1.11$ (well within the $<3$ bound).
de Weger Triple (1985):
- Equation: $2^3 \cdot 128^3 = 3087 \cdot 25^3 + 121$ ( $n=3$ ).
- Result: $G_p \approx 2.21$ .
- Theoretical Limit: Under $q < 2$ , the bound is $G_p < 4.17$ . The observed value is well-contained, confirming the structural rigidity of $G_a$ for $n=3$ .
Nitaj Triple (1993):
- Equation: $1 \cdot 2^{59} = A \cdot 1^{59} + k$ .
- Result: $G_p \approx 3.27$ .
- Significance: This exceeds the $G_p < 3$ conjecture, but the paper attributes this to the triviality of $x=1$ . The theoretical bound for this specific case is $G_p < 3.44$ , showing the triple sits at 95% of the theoretical limit.

5. Significance

Theoretical Foundation for Numerical Observations: The paper moves beyond empirical observation to provide a rigorous proof that high-quality ABC triples in superelliptic equations are structurally constrained. It explains why $G_p$ tends to be low for non-trivial solutions.
Resolution of the $x=1$ Anomaly: It clarifies why certain high-quality triples (like Nitaj's) violate the $G_p < 3$ heuristic: they rely on trivial solutions where coefficients can be arbitrarily large. This validates the necessity of the $x \geq 2$ condition in the conjecture.
Exclusion of Solutions: The derived bounds offer a new method to prove the non-existence of solutions for specific exponents ( $n \geq 4$ for $k=1$ ) assuming the Strong ABC conjecture, contributing to the broader understanding of Diophantine equations.
Structural Rigidity: The work highlights that the "exponential structure" ( $y^n$ ) inherently forces the ABC quality away from zero, making these equations fertile ground for finding high-quality triples, but simultaneously imposing strict limits on the power gain.

Conclusion:
While the ABC conjecture remains unproven, Müller's framework successfully demonstrates that if the Strong ABC conjecture holds, the power gain $G_p$ for non-trivial diagonal superelliptic equations is strictly bounded. The paper effectively bridges the gap between structural number theory and the probabilistic nature of the ABC conjecture.