Configuration formula conjecture for the lowest skew Jack coefficient
Statement
Let be a partition. A finite subset of is a configuration; write and for the partitions obtained by rearranging its row and column lengths in decreasing order. Call a configuration of boxes -admissible if it is obtained from the Young diagram of by the four move types specified in the source. For a partition containing , let be the coefficient of in the skew Jack function, where .
Configuration formula conjecture. For every partition and every -admissible configuration , there are uniquely determined polynomials with nonnegative integer coefficients, invariant under row and column permutations of , such that for every partition ,
where the sum runs over the -admissible configurations contained in the Young diagram of . The polynomials depend only on and , not on .
This conjecture seeks a positive combinatorial expansion generalizing the Knop–Sahi formula from ordinary to skew Jack symmetric functions. The paper reports verification by explicit computations for small partitions, but no general proof is given.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.