Alexandersson's minimal-polynomial conjecture for skew Schur functions
Alexandersson's minimal-polynomial conjecture for skew Schur functions
Let be as in Theorem~. For every vector , let denote the vector obtained by rearranging its coordinates in non-increasing order, and define
For variables , write for the corresponding monomial. Alexandersson's conjecture. For sufficiently large , the sequence
satisfies a linear recursion with minimal polynomial
The conjecture concerns the eventual linear-recursive behavior of skew Schur functions and predicts the complete set of characteristic roots through the vectors in . Its resolution is not established by the supplied text.
Sources & referencesView supporting material
Primary source
Katharina Jochemko, “Linear recursions for integer point transforms”, arXiv:1902.00973 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.