🔢 mathematics

On a nonnegativity conjecture of Andrews

This paper resolves a conjecture by Andrews regarding Alladi-Schur polynomials and establishes additional relations and implications for two associated families of polynomials.

Original authors: Yazan Alamoudi

Published 2026-01-27

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Yazan Alamoudi

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 a master builder working with a very specific set of Lego bricks. These bricks represent numbers, and your goal is to stack them into towers (called "partitions") following strict rules.

In this paper, the author, Yazan Alamoudi, solves a long-standing puzzle about how these towers can be built. Here is the story of the discovery, broken down into simple concepts.

The Two Ways to Build Towers

Mathematicians have been studying two different ways to build these number towers:

The "Odd" Way: You can only use odd-numbered bricks (1, 3, 5...), and you can use any specific brick size at most twice.
The "Schur" Way: You build towers where the bricks must be spaced out (they can't be too close to each other) and you can't have certain specific patterns involving multiples of 3.

A famous theorem (the Alladi-Schur theorem) proved that if you follow the rules for the "Odd" Way and the "Schur" Way, you will end up with the exact same number of possible towers for any given total height. It's like having two different instruction manuals that somehow result in the exact same number of unique castles.

The Mystery of the "Hidden Coefficients"

The mathematician George Andrews took this idea further. He didn't just count the towers; he created a complex formula (a polynomial) to describe them. When he simplified this formula, he found a hidden pattern of numbers inside it, which he called $c(n, j)$ .

Andrews made a bold guess (a conjecture): All the numbers inside this pattern are positive.

Think of it like baking a cake. Andrews had a recipe that involved mixing ingredients. He suspected that if you looked at the final mixture, every single ingredient count would be a positive number (you wouldn't have "negative sugar" or "minus two eggs"). He couldn't prove it, but he was sure it was true. This guess sat unanswered for years.

The Solution: The "Magic Filter"

Yazan Alamoudi, the author of this paper, stepped in to solve the mystery. He used a clever trick involving a "Magic Filter."

The Problem: The original formula was messy and hard to read.
The Filter: Alamoudi created a special mathematical "filter" (a specific polynomial he calls $\mathcal{d}_n$ ). When you run the messy formula through this filter, the result is a much cleaner, simpler version.
The Discovery: By analyzing this filtered version, Alamoudi proved that the "ingredients" (the coefficients) are indeed always positive.

He did this by building a logical ladder. He showed that if the rule holds for small towers, it must hold for bigger towers. He checked the base cases (the smallest towers) and then proved that the rules for building larger towers naturally preserve the "positivity" of the ingredients.

Why This Matters (According to the Paper)

The paper doesn't just say "the numbers are positive." It reveals that the filtered version of the formula is actually stronger than Andrews' original guess.

Andrews' Guess: "The numbers are positive."
Alamoudi's Proof: "Not only are the numbers positive, but they follow a very strict, predictable pattern of growth."

The paper provides new formulas that tell us exactly how these numbers relate to one another. It's like finding out that not only are all the bricks in the castle red, but they are also arranged in a specific, beautiful spiral pattern that we can now calculate precisely.

The "Conserved Quantity"

In the final section, the author makes a fascinating observation about the structure of these towers. He defines a "score" for the towers based on their shape. He finds that there is a "conserved quantity"—a balance that never changes.

Imagine a seesaw. On one side, you have the "shape complexity" of the tower. On the other side, you have the "sign" (positive or negative nature) of the mathematical formula. The paper shows that these two sides always balance out to a specific number (2). This suggests a deep, hidden symmetry in how these number partitions are constructed.

Summary

In short, this paper is a victory for mathematical logic.

The Problem: A famous mathematician guessed that a specific set of numbers in a complex formula were always positive.
The Solution: The author created a new way to look at the formula (a "filter") and proved the guess was right using a step-by-step logical construction.
The Bonus: The proof revealed that the numbers follow even stricter rules than originally thought, uncovering a hidden symmetry in the way these mathematical "towers" are built.

The paper is a pure mathematical achievement, solving a puzzle about the fundamental nature of numbers and patterns, without claiming any immediate use in medicine, engineering, or daily life. It is a story about finding order in complexity.

Technical Summary: On a Nonnegativity Conjecture of Andrews

Problem Statement
This paper addresses a conjecture proposed by George Andrews regarding the nonnegativity of coefficients in specific polynomials derived from the Alladi-Schur theory of integer partitions. The context is the refinement of the Alladi-Schur theorem, which equates the number of partitions of $n$ into $m$ odd parts (each occurring at most twice) with the number of Schur partitions of $n$ (parts differing by at least 3, with no consecutive multiples of 3).

Andrews introduced a family of polynomials $d_N(x)$ generating these partitions. He established factorization relations showing that $d_N(x)$ is divisible by a specific polynomial $p_k(x) = \prod_{i=1}^k (1 + xq^{2i-1} + x^2q^{4i-2})$ . Specifically, for indices of the form $6n-1$ , the quotient is given by:
$\frac{d_{6n-1}(x)}{p_n(x)} = \sum_{i=0}^n c(n, i)x^i$
Andrews conjectured that for all $n$ and $j$ , the coefficients $c(n, j)$ are polynomials in $q$ with nonnegative integer coefficients. While Andrews proved the factorization, the nonnegativity of the resulting quotient coefficients remained unproven.

Methodology
The author, Yazan Alamoudi, resolves the conjecture by defining a generalized family of quotient polynomials $\mathcal{d}_n(x)$ that encompasses the specific case of $c(n, j)$ . The definition is:
$\mathcal{d}_n(x) = \frac{d_n(x)}{p_{\lceil \frac{n+3\chi_o(n)}{6} \rceil - \chi_o(n)}(x)}$
where $\chi_o(n)$ is the indicator function for odd integers.

The proof strategy employs strong induction on $n$ , relying on recursive relations derived from the properties of the underlying partition sets. The methodology involves:

Establishing Recursive Relations: The paper derives specific recurrence relations for $\mathcal{d}_n(x)$ $d_{n} (x)$ based on the index $n$ $n$ modulo 6. These relations connect $\mathcal{d}_n(x)$ $d_{n} (x)$ to $\mathcal{d}_{n-k}(x)$ $d_{n - k} (x)$ (with shifted arguments in $q$ $q$ ) and involve the polynomial $\lambda(x) = 1 + xq + x^2q^2$ $λ (x) = 1 + x q + x^{2} q^{2}$ .
- For even indices: $\mathcal{d}_{2N}(x) = \mathcal{d}_{2N-3}(xq^2)$ .
- For odd indices not divisible by 3: $\mathcal{d}_{2N-1}(x) = \mathcal{d}_{2N-2}(x) + xq^{2N-1}\mathcal{d}_{2N-4}(x)$ .
- For odd indices divisible by 3: A more complex relation involving $\lambda_{N+1}(x)$ is established.
Inductive Verification: By verifying base cases ( $n=1$ to $6$) and demonstrating that the recursive steps preserve the property of having nonnegative integer coefficients, the author proves the general claim.
Extension to Coefficients: The paper further analyzes the coefficients $\mathcal{c}(n, i)$ of $\mathcal{d}_n(x)$ to derive explicit formulas relating them to Andrews' original coefficients $c(n, i)$ .

Key Contributions and Results

Resolution of Andrews' Conjecture: The primary result is Theorem 1, which states that for $n \ge 1$ , $\mathcal{d}_n(x)$ is a polynomial in $x$ and $q$ with nonnegative integer coefficients. This immediately confirms Andrews' conjecture that $c(n, j)$ has nonnegative coefficients.
Generalized Recursive Structure: The paper provides a complete set of recursive relations for the quotient polynomials $\mathcal{d}_n(x)$ , analogous to Andrews' relations for $d_n(x)$ but adapted for the quotient structure.
Explicit Formulas for Coefficients: Theorem 3 provides explicit formulas expressing the coefficients $\mathcal{c}(n, i)$ of the quotient polynomials in terms of Andrews' coefficients $c(n', i')$ . These formulas allow for the calculation of $\mathcal{c}(n, i)$ as polynomials in $q$ .
Strengthened Inequalities: The paper derives inequalities for $c(n, j)$ that are stronger than the mere assertion of nonnegativity. Corollary (3.11) establishes a lower bound:
$c(n, j) \ge q^{6n-1}c(n-1, j-1)q^{2(j-1)}$
Corollary (3.12) provides a more complex lower bound involving a geometric series term, and Corollary (3.13) establishes a divisibility property: $q^{(2n+1)j} \mid c(n, j)$ .

Significance
The paper claims that its resolution of the conjecture is achieved through an approach similar to Andrews' original factorization proofs but framed from a "new perspective" that allows for the resolution of the nonnegativity issue. The significance lies in:

Completing the Theoretical Picture: It settles a conjecture that had remained open, providing a rigorous proof for the nonnegativity of coefficients in the refined Alladi-Schur generating functions.
Stronger Results: The author notes that Theorem 1 is stronger than the original conjecture because it proves the nonnegativity for the entire family of quotient polynomials $\mathcal{d}_n(x)$ , not just the specific case of $d_{6n-1}(x)$ .
Structural Insight: The derived recursive relations and explicit coefficient formulas offer deeper structural insight into the relationship between Alladi-Schur polynomials and their factorizations, potentially aiding future investigations into partition identities.

The paper concludes by acknowledging that the recursive structures found for $\mathcal{d}_n(x)$ mirror those found in a bijective proof by the author in a separate work [1], suggesting a consistent combinatorial underlying structure for these partition families.