ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let V(kΛ0)V(k\Lambda_0) be the integrable highest weight sl^(n)\widehat{sl}(n)-module, with n≥2n\geq 2 and k≥1k\geq 1. A maximal dominant weight is a dominant weight in V(kΛ0)V(k\Lambda_0) that is maximal with respect to subtraction of positive roots.

Enumeration conjecture. For fixed n≥2n\geq 2, the number of maximal dominant weights of V(kΛ0)V(k\Lambda_0) is

1n+k∑d∣gcd⁡(n,k)ϕ(d)((n+k)/dk/d),\frac{1}{n+k}\sum_{d\mid\gcd(n,k)}\phi(d)\binom{(n+k)/d}{k/d},

where ϕ\phi is the Euler phi function.

The formula gives a closed-form count for the maximal dominant weights. The source states that it is proved for k≤3k\leq 3, while the general 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.