ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let λ\lambda be the partition of nn whose diagram is the union of mm rectangles described above. Let μ⊢k\mu\vdash k and fix a permutation wμ∈Skw_\mu\in\mathfrak S_k of cycle type μ\mu. Let Sk(m)\mathfrak S_k^{(m)} be the set of permutations in Sk\mathfrak S_k whose cycles are colored by [m]={1,…,m}[m]=\{1,\dots,m\}. For α=(u,φ)\alpha=(u,\varphi) and v∈Skv\in\mathfrak S_k, define αv=(uv,ψ)\alpha v=(uv,\psi) by assigning to each cycle of uvuv the maximum color among the cycles of uu contributing to it. If κi(α)\kappa_i(\alpha) is the number of cycles of uu colored ii, write pκ(α)=∏ipiκi(α)\boldsymbol p^{\kappa(\alpha)}=\prod_i p_i^{\kappa_i(\alpha)}, and similarly for q\boldsymbol q. Colored-permutation formula conjecture. One has

Fμ(p;q)=(−1)k∑αwμ=βpκ(α)(−q)κ(β),F_\mu(\boldsymbol p;\boldsymbol q)=(-1)^k\sum_{\alpha w_\mu=\beta}\boldsymbol p^{\kappa(\alpha)}(-\boldsymbol q)^{\kappa(\beta)},

where the sum ranges over all (k+m−1)k(k+m-1)_k pairs (α,β)∈Sk(m)×Sk(m)(\alpha,\beta)\in\mathfrak S_k^{(m)}\times\mathfrak S_k^{(m)} satisfying αwμ=β\alpha w_\mu=\beta. This conjecture generalizes the preceding permutation formula, which is stated as a theorem in the source; its status is not resolved in the supplied text.

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.