Sharp Euler-factor positivity for the BG-rank-refined five-core crank
Abstract
In this paper, we complete the resolution of Stanton's problem OPAC--005 by proving its fixed-BG-rank assertion. We further establish a sharp nine-factor positivity theorem for the joint generating function. Let Kn,j(z) enumerate partitions of 5n+4 with BG-rank j by the integer five-core crank prescribed in OPAC--005, and put [5]z=1+z+z2+z3+z4. We prove that Kn,j(z)/[5]z has nonnegative integer Laurent coefficients for every n≥0 and j∈ ℤ. The refined equidistribution theorem of Berkovich and Garvan gives divisibility; the new assertion is coefficientwise nonnegativity. Set Ψ(u,z,q)=∑n≥0∑j∈ ℤqn+1ujKn,j(z) and D(q)=∏d≥1(1−q2d). For every nonnegative integer M, we show that D(q)MΨ(u,z,q)/[5]z has nonnegative coefficients if and only if M≤9. Thus positivity survives after removing nine of the ten partition factors supplied by the core--quotient decomposition. A coefficient equal to −4 at M=10 proves sharpness. The key step is a compensation between lattice terms of different core sizes that preserves both the BG-rank and the full integer crank. Theta identities and three local coefficient inequalities provide the required nonnegative contributions, and an explicit allocation ensures that none is used twice. The resulting factorization also yields a nine-color convolution and coefficientwise finite-difference inequalities through order nine.
Related
- Positivity for a t-analogue of refined Littlewood-Richardson rules
- Real stability of layer-refined antichain polynomials for three-chain products with a two-element factor
- Sharp Global Well-Posedness for the Logarithmically Regularized 2D Euler Equations
- A Sharp Uniqueness-Nonuniqueness Dichotomy for Neutral Vortex Arrays in $2$D Euler Equations
- Stochastic Euler–Poisson–Darboux Equations and a Sharp Dalang Criterion
BibTeX
@misc{xiong2026sharp,
title = {{Sharp Euler-factor positivity for the BG-rank-refined five-core crank}},
author = {Huan Xiong},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.28186},
eprint = {2610.28186},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.28186},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Sharp Euler-factor positivity for the BG-rank-refined five-core crank
AU - Huan Xiong
PY - 2026
DA - 2026/10/20
PB - arXiv
DO - 10.48550/arxiv.2610.28186
UR - https://arxiv.org/abs/2610.28186
AB - In this paper, we complete the resolution of Stanton's problem OPAC--005 by proving its fixed-BG-rank assertion. We further establish a sharp nine-factor positivity theorem for the joint generating function. Let K_n,j(z) enumerate partitions of 5n+4 with BG-rank j by the integer five-core crank prescribed in OPAC--005, and put [5]_z=1+z+z^2+z^3+z^4. We prove that K_n,j(z)/[5]_z has nonnegative integer Laurent coefficients for every n≥0 and j∈ ℤ. The refined equidistribution theorem of Berkovich and Garvan gives divisibility; the new assertion is coefficientwise nonnegativity. Set Ψ(u,z,q)=∑_n≥0∑_j∈ ℤq^n+1u^jK_n,j(z) and D(q)=∏_d≥1(1−q^2d). For every nonnegative integer M, we show that D(q)^MΨ(u,z,q)/[5]_z has nonnegative coefficients if and only if M≤9. Thus positivity survives after removing nine of the ten partition factors supplied by the core--quotient decomposition. A coefficient equal to −4 at M=10 proves sharpness. The key step is a compensation between lattice terms of different core sizes that preserves both the BG-rank and the full integer crank. Theta identities and three local coefficient inequalities provide the required nonnegative contributions, and an explicit allocation ensures that none is used twice. The resulting factorization also yields a nine-color convolution and coefficientwise finite-difference inequalities through order nine.
ER -