The Kostka-support conjecture for minimal recurrences of stretched skew Schur polynomials
Statement
Let be partitions of length at most such that and for some positive integer . For a vector , let denote the corresponding Kostka coefficient, and let be the rearrangement of into a partition; write for dominance order. Define
The Kostka-support conjecture. For sufficiently large , the sequence
satisfies a linear recurrence with minimal characteristic polynomial
This is proposed as a sharper version of the paper's greedy recurrence theorem, replacing its potentially larger root set by the support determined by Kostka coefficients and dominance order; its resolution is not supplied here.
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.