PreprintCC BY 4.0arXiv
A finite cover for coefficient positivity of stretched Littlewood-Richardson polynomials in the seven-row, size-thirty box
Abstract
We give a finite cover argument for nonnegativity of the ordinary monomial coefficients of every stretched Littlewood-Richardson polynomial with partition lengths at most seven and outer size at most thirty. Explicit reductions leave 358,952 residual triples. The computational part consists of exact finite enumeration, local reduction checks and rational Ehrhart polynomial computations. Its three named dependencies are stated precisely below, separately from the mathematical implication they establish.
Related
- Positivity of stretched Littlewood-Richardson coefficients for partitions of length at most five
- Positivity for a t-analogue of refined Littlewood-Richardson rules
- A Littlewood-Richardson Rule for Forest Polynomials
- Schur positivity of the nabla operator on two-column modified Hall--Littlewood polynomials
- Congruences of shifted Jack Littlewood-Richardson coefficients
BibTeX
@misc{ghodsi2026finite,
title = {{A finite cover for coefficient positivity of stretched Littlewood-Richardson polynomials in the seven-row, size-thirty box}},
author = {Maseeh Ghodsi},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.14357},
eprint = {2609.14357},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.14357},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - A finite cover for coefficient positivity of stretched Littlewood-Richardson polynomials in the seven-row, size-thirty box
AU - Maseeh Ghodsi
PY - 2026
DA - 2026/09/13
PB - arXiv
DO - 10.48550/arxiv.2609.14357
UR - https://arxiv.org/abs/2609.14357
AB - We give a finite cover argument for nonnegativity of the ordinary monomial coefficients of every stretched Littlewood-Richardson polynomial with partition lengths at most seven and outer size at most thirty. Explicit reductions leave 358,952 residual triples. The computational part consists of exact finite enumeration, local reduction checks and rational Ehrhart polynomial computations. Its three named dependencies are stated precisely below, separately from the mathematical implication they establish.
ER -