ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer and let kk satisfy k≤nk\leq n. Let MPFn,k\mathcal{M P F}_{n,k} be the set of valley-marked parking functions of size nn with kk marked valleys and labels [n][n]. For such a parking function, let area⁡\operatorname{area}, dinv⁡\operatorname{dinv}, and ides⁡\operatorname{ides} denote its area, marked diagonal-inversion, and inverse-descent statistics, respectively. Let ene_n be the elementary symmetric function, let Δen−k−1′\Delta'_{e_{n-k-1}} denote the primed Delta operator indexed by en−k−1e_{n-k-1}, and let Fides⁡F_{\operatorname{ides}} be the fundamental quasisymmetric function indexed by the inverse-descent set. The Delta Conjecture, valley version. For all k≤nk\leq n,

Δen−k−1′en=∑MPF∈MPFn,ktarea⁡(MPF)qdinv⁡(MPF)Fides⁡(MPF).\Delta'_{e_{n-k-1}}e_n=\sum_{M P F\in\mathcal{M P F}_{n,k}}t^{\operatorname{area}(M P F)}q^{\operatorname{dinv}(M P F)}F_{\operatorname{ides}(M P F)}.

This is one of the principal combinatorial formulations of the Delta Conjecture; the case z=0z=0 recovers the Shuffle Theorem. Many special cases have been proved, but the general conjecture remains open.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.