Alexandersson's minimal-polynomial conjecture for skew Schur functions

About 7 years old · traced to

Let κ,λ,μ,ν\pmb{\kappa},\pmb{\lambda},\pmb{\mu},\pmb{\nu} be as in Theorem~. For every vector w\mathbf{w}, let w‾\overline{\mathbf{w}} denote the vector obtained by rearranging its coordinates in non-increasing order, and define

W={w∈Nn ⁣:Kλ/μ,w>0 and w‾⊵λ−μ‾}.W=\{\mathbf{w}\in\mathbb{N}^n\colon K_{\pmb{\lambda}/\pmb{\mu},\mathbf{w}}>0\text{ and }\overline{\mathbf{w}}\unrhd\overline{\pmb{\lambda}-\pmb{\mu}}\}.

For variables x\mathbf{x}, write xw\mathbf{x}^{\mathbf{w}} for the corresponding monomial. Alexandersson's conjecture. For sufficiently large rr, the sequence

{sκ+lμ/λ+lν(x)}l=r∞\{s_{\kappa+l\mu/\lambda+l\nu}(\mathbf{x})\}_{l=r}^{\infty}

satisfies a linear recursion with minimal polynomial

χ(X)=∏w∈W(X−xw).\chi(X)=\prod_{\mathbf{w}\in W}(X-\mathbf{x}^{\mathbf{w}}).

The conjecture concerns the eventual linear-recursive behavior of skew Schur functions and predicts the complete set of characteristic roots through the vectors in WW. Its resolution is not established by the supplied text.

References

Primary source

Katharina Jochemko, “Linear recursions for integer point transforms”, arXiv:1902.00973 (2019).

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.