ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m,nm,n be nonnegative integers with ∣m−n∣|m-n| even. Let pp be a nonnegative integer and rr an integer with 0≤r≤p0\leq r\leq p. Consider the representation of osp(2m∣2n)\mathfrak{osp}(2m|2n) with Dynkin labels [0,…,0,r,p−r][0,\ldots,0,r,p-r]. Let Br{\cal B}_r be the set of partitions specified in the paper, let sλ(x/y)s_\lambda(x/y) denote the supersymmetric Schur function, and let x1,…,xmx_1,\ldots,x_m and y1,…,yny_1,\ldots,y_n be the relevant character variables. The even-rank fork character conjecture. For ∣m−n∣|m-n| even, one has

char⁡[0,…,0,r,p−r]osp(2m∣2n)=(y1⋯yn/x1⋯xm)p/2∑λ1≤p,  λ∈Brsλ(x/y).\operatorname{char} [0,\ldots,0,r,p-r]_{\mathfrak{osp}(2m|2n)} = (y_1\cdots y_n/x_1\cdots x_m)^{p/2} \sum_{\lambda_1\leq p,\; \lambda\in{\cal B}_r} s_\lambda (x/y).

Thus the character expands as an infinite sum of supersymmetric Schur functions indexed by partitions inside the (m,n)(m,n)-hook, of width at most pp, and belonging to Br{\cal B}_r. This formula is the explicit version of the proposed correspondence for fork representations. The analogous odd-∣m−n∣|m-n| case is described separately in the paper with Br{\cal B}_r replaced by Bp−r{\cal B}_{p-r}; the displayed even case is presented as a conjecture.

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.