ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let R(n;r,ℓ)\mathcal{R}(n;r,\ell) be the multigraded SnS_n-module with commuting and anticommuting variable sets, let ch⁡R(n;r,ℓ)\operatorname{ch}\mathcal{R}(n;r,\ell) be its Sn×GLr(C)×GLℓ(C)S_n\times GL_r(\mathbb{C})\times GL_\ell(\mathbb{C}) character, and let

En(x,q)=∑λ,μbλ,μsλ(x)sμ(q)\mathcal{E}_n(\mathbf{x},\mathbf{q})=\sum_{\lambda,\mu}b_{\lambda,\mu}s_\lambda(\mathbf{x})s_\mu(\mathbf{q})

be the stable character for commuting variables. Let z\mathbf{z} be an infinite alphabet of anticommuting tracking variables and cν,ρμc_{\nu,\rho}^{\mu} a Littlewood–Richardson coefficient. Bergeron's combinatorial supersymmetry conjecture. For any r,ℓ≥0r,\ell\geq0, ch⁡R(n;r,ℓ)\operatorname{ch}\mathcal{R}(n;r,\ell) is obtained from

∑λ,μ,ν,ρbλ,μcν,ρμsλ(x)sν(q)sρ′(z)\sum_{\lambda,\mu,\nu,\rho}b_{\lambda,\mu}c_{\nu,\rho}^{\mu}s_\lambda(\mathbf{x})s_\nu(\mathbf{q})s_{\rho'}(\mathbf{z})

by setting qi=0q_i=0 for i>ri>r and zj=0z_j=0 for j>ℓj>\ell. The conjecture predicts that all mixed commuting–anticommuting characters are determined by the stable commuting character. The source gives no resolution status.

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.