Generic SNP conjecture for nonsymmetric Macdonald polynomials

From papers

Let αZ0n\alpha\in\mathbb Z_{\geq0}^n, and let Eα(X;q,t)E_\alpha(X;q,t) be the nonsymmetric Macdonald polynomial. Write

Eα(X;q,t)=xα+β<Sαdα,β(q,t)xβ,E_\alpha(X;q,t)=x^\alpha+\sum_{\beta<_S\alpha}d_{\alpha,\beta}(q,t)x^\beta,

where <S<_S is the ordering generated by the stated transposition and transfer moves. Let P^α\widehat{\mathcal P}_\alpha be the convex hull of all βZ0n\beta\in\mathbb Z_{\geq0}^n with βSα\beta\leq_S\alpha. Generic SNP conjecture. If βP^α\beta\in\widehat{\mathcal P}_\alpha and βZ0n\beta\in\mathbb Z_{\geq0}^n, then βSα\beta\leq_S\alpha. This would imply that the generic specialization of EαE_\alpha is SNP; the claim was checked for n7n\leq7 and α7|\alpha|\leq7, but remains open in general.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Cara Monical, Neriman Tokcan and Alexander Yong, “Newton Polytopes in Algebraic Combinatorics”, arXiv:1703.02583 (2017).

Solutions 0

No solutions have been posted yet.