ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be the reductive group defining the Kottwitz–Viehmann variety, let FF be its base field, let TT be a maximal torus, and let G(F)rsG(F)^{\mathrm{rs}} denote the regular semisimple locus. For γ∈G(F)rs\gamma\in G(F)^{\mathrm{rs}} and λ∈X∗(T)+\lambda\in X_*(T)_+, let νγ∈X∗(T)Q,+\nu_\gamma\in X_*(T)_{\mathbb{Q},+} be the Newton point and let μ∈X∗(T)+\mu\in X_*(T)_+ be the minimal dominant integral coweight dominating νγ\nu_\gamma. Write XγλX_\gamma^\lambda for the corresponding Kottwitz–Viehmann variety, Gγ(F)G_\gamma(F) for the loop-group centralizer, and Irr⁡\operatorname{Irr} for the set of irreducible components. Let mλμm_{\lambda\mu} denote the dimension of the μ\mu-weight space in the irreducible representation of the Langlands dual group G^\hat{G} with highest weight λ\lambda. Irreducible-component conjecture. The number of irreducible components of the quotient stack [Xγλ/Gγ(F)][X_\gamma^\lambda/G_\gamma(F)], equivalently the number of Gγ(F)G_\gamma(F)-orbits on Irr⁡(Xγλ)\operatorname{Irr}(X_\gamma^\lambda), equals mλμm_{\lambda\mu}:

#Irr⁡[Xγλ/Gγ(F)]=mλμ.\#\operatorname{Irr}[X_\gamma^\lambda/G_\gamma(F)]=m_{\lambda\mu}.

Although XγλX_\gamma^\lambda may have infinitely many irreducible components, the quotient stack always has finitely many. The conjecture proposes a representation-theoretic description of this finite number in terms of a weight multiplicity for the Langlands dual group; no resolution is supplied in the source.

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.