ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each a∈C×/qZa\in\mathbb C^\times/q^{\mathbb Z} and i∈Ii\in I, suppose there are na(i)∈Z≥−1n_a(i)\in\mathbb Z_{\geq-1}, X∈CX\in\mathbb C, and r∈Zr\in\mathbb Z such that

fi(a)(u)=X(1−aqru)na(i).f_i^{(a)}(u)=X(1-aq^ru)^{n_a(i)}.

Let

S(a)={i∈I:na(i)=−1},U(a)={i∈I:na(i)>0}.S^{(a)}=\{i\in I:n_a(i)=-1\},\qquad U^{(a)}=\{i\in I:n_a(i)>0\}.

Assume conditions (1)--(3) in the statement: every pair of distinct elements of S(a)S^{(a)} has an element of U(a)U^{(a)} in its connecting subdiagram; each isolated S(a)S^{(a)}--U(a)U^{(a)} pair has the prescribed straight-labelling relation; and na(j)≥∣Na(j)∣−1n_a(j)\geq|N_a(j)|-1 for every j∈U(a)j\in U^{(a)}, where

Na(j)={i∈S(a):{i,j}‾∩(S(a)∪U(a))={i,j}}.N_a(j)=\{i\in S^{(a)}:\overline{\{i,j\}}\cap(S^{(a)}\cup U^{(a)})=\{i,j\}\}.

Separated-poles-and-zeros character conjecture. The character of L(f)L(\boldsymbol f) is

χ(L(f))=wt⁡(f)∏a∈C×/qZχ(a),\chi(L(\boldsymbol f))=\operatorname{wt}(\boldsymbol f)\prod_{a\in\mathbb C^\times/q^{\mathbb Z}}\chi^{(a)},

where

χ(a)=∏α∈Δ+(11−α‾−1)max⁡(0,∑i∈S(a)⟨ωi∨,α⟩−∑j∈U(a)na(j)⟨ωj∨,α⟩).\chi^{(a)}=\prod_{\alpha\in\Delta^+}\left(\frac{1}{1-\overline{\alpha}^{-1}}\right)^{\max\left(0,\sum_{i\in S^{(a)}}\langle\omega_i^\vee,\alpha\rangle-\sum_{j\in U^{(a)}}n_a(j)\langle\omega_j^\vee,\alpha\rangle\right)}.

This is a further generalization of the generic parabolic Verma-module character conjecture. The source proves several special cases of that earlier conjecture, but does not establish this full formula.

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.