Flag conjecture for largest Littlewood–Richardson coefficients

Let λn\lambda\vdash n, and let μ\mu and ν\nu be partitions with cμ,νλ=C(n)c^\lambda_{\mu,\nu}={\rm C}(n), where C(n){\rm C}(n) denotes the largest Littlewood–Richardson coefficient at size nn. The flag conjecture. One of the two indexing partitions contains the other:

μνorνμ.\mu\subseteq\nu\quad\text{or}\quad\nu\subseteq\mu.

The conjecture would describe the maximizers of the global largest Littlewood–Richardson coefficient. The source motivates it by computational evidence, and it remains open.

Sources & referencesView supporting material

Primary source

Igor Pak, Greta Panova and Damir Yeliussizov, “On the largest Kronecker and Littlewood–Richardson coefficients”, arXiv:1804.04693 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.