ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Rn(1,3)R_n^{(1,3)} be the (1,3)(1,3)-bosonic-fermionic coinvariant ring, let Frob⁡(Rn(1,3);q;u,v,w)\operatorname{Frob}(R_n^{(1,3)};q;u,v,w) denote its Frobenius series, and let s(1n)s_{(1^n)} denote the Schur function of the sign representation. The (1,3)(1,3) sign-character conjecture. Based on data for n≤5n \leq 5, the source proposes

⟨Frob⁡(R(1,3);q;u,v,w),s(1n)⟩=∑k,ℓ,d≥0ukvℓwdq(n−d−k−ℓ2)\qbinomn−1−dℓq\qbinomn−1−kdq\qbinomn−1−ℓkq.\left\langle \operatorname{Frob}( R^{(1,3)};q;u,v,w), s_{(1^n)}\right\rangle = \sum_{k,\ell,d \geq 0} u^k v^\ell w^d q^{\binom{n-d-k-\ell}{2}}\qbinom{n-1-d}{\ell}_q\qbinom{n-1-k}{d}_q\qbinom{n-1-\ell}{k}_q.

Here \qbinomabq\qbinom{a}{b}_q denotes the qq-binomial coefficient. The formula conjecturally gives the multigraded sign-character multiplicity; the supplied text reports computational evidence for n≤5n \leq 5 but no resolution.

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.