Kostka-matrix termwise divisibility conjecture

From papers

Let pp be prime, let e<fe<f be positive integers, and set m=pem=p^e, n=pfn=p^f, and k=n/m=pfek=n/m=p^{f-e}. Let MseM^{se} and MesM^{es} denote the change-of-basis matrices between the Schur and elementary bases, and let λ~\widetilde{\lambda}^* denote the transpose dual of λ\lambda. For every tuple {cλμν}\{c_{\lambda\mu\nu}\} of nonnegative integers whose entries sum to 2(k1)2(k-1), Kostka-matrix termwise divisibility conjecture. One has

pfe(2(k1){cλμν})(λ,μ,νMλμseMλ~νse)Mλ,μ,νcλμνμ,(nm)mesMλ,μ,νcλμνν,(nm)mes.p^{f-e}\mid \binom{2(k-1)}{\{c_{\lambda\mu\nu}\}}\left(\prod_{\lambda,\mu,\nu}M^{se}_{\lambda\mu}M^{se}_{\widetilde{\lambda}^*\nu}\right)M^{es}_{\sum_{\lambda,\mu,\nu}c_{\lambda\mu\nu}\mu,(n-m)^m}M^{es}_{\sum_{\lambda,\mu,\nu}c_{\lambda\mu\nu}\nu,(n-m)^m}.

This is a reformulation of the preceding termwise conjecture in terms of change-of-basis coefficients, which are expressible through Kostka numbers. It gives a combinatorial divisibility condition that is stronger than the valuation claim for g(m,n)g(m,n); the source presents it as a reformulation and does not report a general proof.

Progress summary

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

Sources & referencesView supporting material

Primary source

Arnav Tripathy, “A combinatorial divisibility question from noncommutative algebra”, arXiv:1611.07982 (2016).

Solutions 0

No solutions have been posted yet.