Factorizability conjecture for Stanley Jack gg-polynomials

Let bbigλbbig \lambda, bbigmubbig mu, and bbignubbig nu be partitions, and let cbbigλbbigmu,bbignuc^bbig \lambda_{bbig mu,bbig nu} be the Littlewood–Richardson coefficient. For each box ss of a partition bbigpibbig pi, let cbbigpi,sc_{bbig pi,s} and cbbigpi,sc'_{bbig pi,s} denote the two Jack hook factors, and write gbbigλbbigmu,bbignug^bbig \lambda_{bbig mu,bbig nu} for the corresponding Jack gg-polynomial.

Factorizability conjecture. If

cμ,νλ=1,c^\lambda_{\mu,\nu}=1,

then gbbigλbbigmu,bbignug^bbig \lambda_{bbig mu,bbig nu} is a product of linear factors. More precisely,

gμ,νλ=(sλcλ,s)(sμcμ,s)(sνcν,s),g^\lambda_{\mu,\nu}=\left(\prod_{s\in\lambda}c^*_{\lambda,s}\right)\left(\prod_{s\in\mu}c^*_{\mu,s}\right)\left(\prod_{s\in\nu}c^*_{\nu,s}\right),

where, for bbigpi=bbigλ,bbigmu,bbignubbig pi=bbig \lambda,bbig mu,bbig nu and s\inbbigpis\inbbig pi, either cbbigpi,s=cbbigpi,sc^*_{bbig pi,s}=c_{bbig pi,s} or cbbigpi,s=cbbigpi,sc^*_{bbig pi,s}=c'_{bbig pi,s}, with each of the two choices occurring bbigλ|bbig \lambda| times in total.

The conjecture concerns a particularly rigid factorization pattern for Jack structure polynomials when the relevant Littlewood–Richardson coefficient is one. The source proves it in several special cases, but leaves the general assertion open.

Sources & referencesView supporting material

Primary source

Paolo Bravi and Jacopo Gandini, “Some combinatorial properties of skew Jack symmetric functions”, arXiv:2107.00453 (2021).

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.