---
title: Alladi-Schur Polynomials
url: https://www.emergentmind.com/topics/alladi-schur-polynomials
type: topic
---

# Alladi-Schur Polynomials

Searching arXiv for recent and foundational papers on Alladi–Schur polynomials and related refinements.
Alladi-Schur polynomials are bounded generating polynomials attached to the Alladi-Schur theorem and its refinements. In the formulation used in recent work, they are the polynomials
\[
d_N(x)=\sum_{n,m\ge 0}|D_N(m,n)|x^m q^n,
\]
where \(D_N(m,n)\) denotes Schur partitions of \(n\) with \(m(\pi)=m\) and all parts \(\le N\), and \(m(\pi)\) is the number of parts plus the number of even parts of \(\pi\). They sit at the intersection of partition identities, \(q\)-series, finitization, and bijective combinatorics: they encode bounded versions of the Schur/Alladi correspondence, admit recursive descriptions, appear as specializations of explicit Andrews-Gordon type multiple sums, and have recently been studied through positivity, factorization, and \(q\)-hypergeometric generalizations [2410.15630] [2110.13247] [2508.10871] [2502.04712].

## 1. Partition-theoretic definition

The underlying partition identity equates two classes. On one side are Schur partitions: partitions of \(n\) into parts such that consecutive parts differ by at least \(3\), and no two consecutive parts are multiples of \(3\). On the other side are partitions of \(n\) into odd parts, each occurring at most twice. If \(m(\pi)\) denotes the number of parts of a partition \(\pi\) plus the number of even parts in \(\pi\), then the refinement recorded in recent work is
\[
|D(m,n)|=|C(m,n)|,
\]
where \(D(m,n)\) is the set of Schur partitions of \(n\) with \(m(\pi)=m\), and \(C(m,n)\) is the set of partitions of \(n\) into \(m\) odd parts, each occurring at most twice [2410.15630].

Within this framework, the Alladi-Schur polynomials are the bounded generating functions
\[
d_N(x)=\sum_{n,m\ge 0}|D_N(m,n)|x^m q^n,
\]
with \(D_N(m,n)\) defined by the additional condition that all parts are \(\le N\) [2410.15630]. The 2021 analytic study describes the Alladi-Schur polynomials as finite polynomial analogues/generating functions that enumerate partitions with certain restrictions and that refine classical Schur and Gleißberg results [2110.13247].

This bounded viewpoint is essential. It converts a global partition theorem into a family of polynomials indexed by the maximal part, making it possible to study recursion, factorization, nonnegativity, and analytic specialization in a controlled way.

## 2. Recursive structure and finitization

A central structural feature of the Alladi-Schur polynomials is that they satisfy explicit recurrences. With
\[
\lambda(x)=1+xq+xq^2,
\]
the bounded polynomials obey
\[
d_{2N}(x)=\lambda(x)d_{2N-3}(xq)
\]
and, for odd indices,
\[
d_{2N-1}(x)=\lambda(x)\left(d_{2N-4}(xq)+xq^{2N-1}(1-xq)d_{2N-7}(xq)\right).
\]
A truncation recurrence is also available:
\[
d_N(x)=d_{N-1}(x)+x^{1+\chi(N)}q^N d_{N-3-\chi(N)}(x),
\]
where \(\chi(N)\) is \(1\) if \(N\) is a multiple of \(3\) and \(0\) otherwise [2410.15630].

These formulas encode how bounded Schur partitions are built by adjoining or removing the largest allowable part. In the description accompanying the recurrences, the factor \(\lambda(x)\) records the allowable augmentation patterns, while the truncation recurrence isolates the effect of the maximal part \(N\) [2410.15630].

For the theory of Alladi-Schur polynomials, these recurrences play two roles. First, they define a finitized analogue of the infinite partition identity. Second, they make the polynomials accessible to inductive and bijective analysis, which later developments exploit in both combinatorial and algebraic directions.

## 3. Bijective interpretation and Andrews’ refinement

A 2024 paper gives a bijective proof of Andrews’ refinement of the Alladi-Schur theorem and uses the same framework to recover Andrews’ recursive relations for the Alladi-Schur polynomials [2410.15630]. On the side of partitions into odd parts, the construction uses an Alladi grouping map \(G'\), an Alladi reduction map \(\psi'\), and their composition
\[
\varphi'=\psi'\circ G'.
\]
The decomposition
\[
G': C(m,n)\to C'(m,n)\cup C'(m-1,n-1)\cup C'(m-2,n-2)
\]
separates the effect of removing \(1\)’s, and \(\psi'\) then subtracts \(2\) from each remaining part [2410.15630].

On the Schur side, the bijection requires a more delicate factorization. The paper introduces upper minimal segments and lower minimal segments, together with a map
\[
\rho:\text{Upper minimal segments}\to \text{Lower minimal segments},
\]
designed to preserve partition statistics while respecting the Schur conditions. The Schur reduction map \(\psi\) acts by decreasing pairs by \(3\), free odd singletons by \(2\), free even singletons by \(4\), and minimal segments via \(\rho\). This yields the decomposition
\[
\varphi=\psi\circ G: D(m,n)\to D(m,n-2m)\cup D(m-1,n-2m+1)\cup D(m-2,n-2m+2),
\]
and hence
\[
D(m,n)=D(m,n-2m)+D(m-1,n-2m+1)+D(m-2,n-2m+2)
\]
in the notation of the paper [2410.15630].

The same bijective machinery reproduces the polynomial recurrences. In particular,
\[
\varphi_{2N}: D_{2N}(m,n)\to D_{2N-3}(m,n-2m)\cup D_{2N-3}(m-1,n-2m+1)\cup D_{2N-3}(m-2,n-2m+2),
\]
which bijectively realizes the even-index recurrence for \(d_{2N}(x)\), and an analogous construction gives the odd-index relation for \(d_{2N-1}(x)\) [2410.15630]. This places the Alladi-Schur polynomials within a fully combinatorial recursive scheme rather than a purely generating-function framework.

## 4. Linked partition ideals and analytic generalizations

The 2021 paper “Linked partition ideals and the Alladi--Schur theorem” studies a larger partition class
\[
\mathscr{S},
\]
consisting of integer partitions into parts differing by at least \(3\), with the additional restriction that no two consecutive multiples of \(3\) occur [2110.13247]. For \(\lambda\in\mathscr{S}\), it derives trivariate generating functions in which \(x\) marks the number of parts, \(y\) marks the number of even parts, and \(q\) marks the weight. The main formula is
\[
\sum_{\lambda\in\mathscr{S}} x^{\#(\lambda)} y^{\#_{0,2}(\lambda)} q^{|\lambda|}
=
\sum_{n_1,n_2,n_3\ge 0}
\frac{(-1)^{n_3} x^{n_1+2n_2+3n_3} y^{n_2+n_3}
q^{4\binom{n_1}{2}+4\binom{n_2}{2}+18\binom{n_3}{2}+2n_1n_2+6n_2n_3+6n_3n_1+n_1+2n_2+9n_3}}
{(q^2;q^2)_{n_1}(q^2;q^2)_{n_2}(q^6;q^6)_{n_3}}.
\]

The paper emphasizes several structural features of this triple sum. It is of Andrews-Gordon type; the denominator factors \((q^2;q^2)_{n_1}\), \((q^2;q^2)_{n_2}\), and \((q^6;q^6)_{n_3}\) arise from linked partition ideal decomposition; and the exponents of \(q\) are quadratic forms encoding the difference conditions and restrictions defining \(\mathscr{S}\) [2110.13247]. Variants with further restrictions on the smallest part appear as equations \((1.7)\) and \((1.8)\).

For the theory of Alladi-Schur polynomials, the decisive specialization is \(y=x\). In that case the triple sum becomes an analytic form of Andrews’ recent refinement of the Alladi-Schur theorem, and the paper states that these generating functions generalize and refine the Alladi-Schur polynomials [2110.13247]. The method proceeds through linked partition ideals, with \(\mathscr{S}\) realized as a span one linked partition ideal with modulus \(6\), leading to a system of \(q\)-difference equations, holonomic \(q\)-difference methods, and computer-assisted/algebraic verification. The same work states that it provides two independent proofs—analytic/\(q\)-hypergeometric and computer algebra/certification—for the key identities of Alladi-Schur type [2110.13247].

## 5. Factorization, normalized quotients, and nonnegativity

A distinct line of development concerns the internal algebraic structure of the polynomials. The 2025 paper “On a nonnegativity conjecture of Andrews” studies the Alladi-Schur polynomials \(d_N(x)\) through the factorization
\[
d_{6n-1}(x)=p_n(x)\cdot \sum_{i=0}^{n} c(n,i)x^i,
\]
where
\[
p_n(x)=\prod_{i=1}^n (1+xq^{2i-1}+x^2q^{4i-2}).
\]
Andrews conjectured that for all \(n\) and \(j\), the coefficients \(c(n,j)\) are polynomials in \(q\) with nonnegative coefficients; the paper states that this conjecture had stood unresolved for several years [2508.10871].

The proof is organized around normalized quotient polynomials
\[
\mathscr{d}_n(x)=\frac{d_n(x)}{p_{\left\lceil\frac{n+3\chi_o(n)}{6}\right\rceil-\chi_o(n)}(x)},
\]
where \(\chi_o(n)\) is the indicator function for odd \(n\). Its central theorem is that for all \(n\ge 1\), \(\mathscr{d}_n(x)\) is a polynomial in \(x\) and \(q\) with nonnegative integer coefficients. The paper then states: hence, Andrews’ conjecture is true [2508.10871].

The inductive proof uses explicit recurrences:
\[
\mathscr{d}_{2N}(x)=\mathscr{d}_{2N-3}(xq^2),
\]
\[
\mathscr{d}_{2N-1}(x)=\mathscr{d}_{2N-2}(x)+xq^{2N-1}\mathscr{d}_{2N-4}(x),
\]
and
\[
\mathscr{d}_{6N+3}(x)=\lambda_{N+1}(x)\mathscr{d}_{6N+2}(x)+xq^{6N+3}\mathscr{d}_{6N-1}(x),
\qquad
\lambda_N(x)=1+xq^{2N-1}+x^2q^{4N-2}.
\]
Further recurrences include
\[
\lambda_{\left\lceil\frac{2N}{6}\right\rceil}(x)\mathscr{d}_{2N}(x)=\mathscr{d}_{2N-1}(x)+x^2q^{2N}\mathscr{d}_{2N-3}(x)
\]
or
\[
\mathscr{d}_{6N}(x)=\mathscr{d}_{6N-1}(x)+x^2q^{6N}\mathscr{d}_{6N-4}(x),
\]
together with the higher-depth odd recursion
\[
\mathscr{d}_{2N-1}(x)=\lambda_{\left\lceil\frac{2N+2}{6}\right\rceil}(x)\mathscr{d}_{2N-4}(xq^2)+xq^{2N-1}(1-xq)\mathscr{d}_{2N-7}(xq^2)
\]
[2508.10871].

The same paper also relates the coefficients of \(\mathscr{d}_n(x)\) to the coefficients \(c(n,i)\). Writing
\[
\mathscr{d}_n(x)=\sum_{i\ge 0}\mathscr{c}(n,i)x^i,
\]
it gives, for example,
\[
\mathscr{c}(6N,j)=c(N,j)+q^{6N}c(N-1,j-2)q^{2(j-2)},
\]
\[
\mathscr{c}(6N-1,j)=c(N,j),
\]
and
\[
\mathscr{c}(6N-2,j)=c(N,j)-q^{6N-1}c(N-1,j-1)q^{2(j-1)}.
\]
It also derives lower bound inequalities such as
\[
c(n,j)\ge q^{6n-1}c(n-1,j-1)q^{2(j-1)}
\]
and the divisibility property
\[
q^{(2n+1)j}\mid c(n,j)
\]
[2508.10871]. These results move the subject beyond existence of a factorization to coefficientwise positivity, recursive structure, and arithmetic constraints.

## 6. \(q\)-hypergeometric extensions and broader polynomial frameworks

The 2025 paper “Some \(q\)-hypergeometric identities associated with partition theorems of Lebesgue, Schur and Capparelli” places Alladi-Schur-type objects inside a broader analytic framework [2502.04712]. Its central result is a polynomial identity in three variables \(a,b,c\), with degree controlled by two integers \(L,M\). The paper states that, by letting \(L\) and \(M\) tend to infinity, one recovers the 1993 Alladi-Gordon \(q\)-hypergeometric key identity for the generalized Schur theorem as well as the fundamental Lebesgue identity by two different choices of variables [2502.04712].

According to the paper, this three-variable identity provides a generalization and unified approach to the Schur and Lebesgue theorems. It also supplies, for the first time, a key analytic identity for Andrews’ deep refinement of the Alladi-Schur theorem, identified in the summary as equation \((6.8)\) [2502.04712]. In this sense, Alladi-Schur polynomials are not isolated finitizations but part of a wider family of polynomial and \(q\)-hypergeometric identities.

The same work presents an infinite hierarchy of identities parameterized by \(r\), with \(r=0\) yielding Euler’s partition theorem, \(r=1\) the Lebesgue identity, and \(r=2\) the generalized Capparelli identities, together with corresponding finite polynomial versions [2502.04712]. The summary explicitly states that the notion of Alladi-Schur polynomials encapsulates and extends the generating functions for the partition classes studied there. A plausible implication is that the Alladi-Schur setting functions as a prototype for finitized generating series in which congruence conditions, multiplicity bounds, and difference conditions are handled simultaneously through multivariable \(q\)-series.

Taken together, these developments show that Alladi-Schur polynomials occupy a central position in modern partition theory. They provide bounded generating functions for a refined Schur-type correspondence, admit direct bijective realizations, arise as specializations of linked-partition-ideal generating functions of Andrews-Gordon type, satisfy nontrivial factorization and nonnegativity phenomena, and extend naturally into three-variable and hierarchical \(q\)-hypergeometric frameworks [2410.15630] [2110.13247] [2508.10871] [2502.04712].

Source: https://www.emergentmind.com/topics/alladi-schur-polynomials