On the largest Littlewood--Richardson coefficient
Combinatorics
2026-08-04 v1
Abstract
We study partitions which attain the largest Littlewood-Richardson coefficient. More precisely, we prove that the largest is attained at partitions such that and is a disjoint union of squares. We conjecture that for , all largest must satisfy this property. We confirm this conjecture numerically, for .
Cite
@article{arxiv.2608.03281,
title = {On the largest Littlewood--Richardson coefficient},
author = {Igor Pak and Daniel Soskin},
journal= {arXiv preprint arXiv:2608.03281},
year = {2026}
}