ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SnS_n be the symmetric group, and let obreakpn obreak\mathbf{p}_n denote the number of Kostant positive elements in SnS_n, where an element is Kostant positive if Kostant's problem for the corresponding simple highest weight module in the principal block of category O\mathcal{O} for sln(C)\mathfrak{sl}_n(\mathbb{C}) has a positive answer. Almost-all-permutations conjecture. Almost all elements in SnS_n are Kostant negative, in the sense that

pnn!→0\frac{\mathbf{p}_n}{n!}\to 0

as n→∞n\to\infty. This conjecture concerns the asymptotic prevalence of negative answers to Kostant's problem among simple highest weight modules in the principal block; the paper proves this assertion.

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.