Almost all permutations are Kostant negative
Statement
Let be the symmetric group, and let denote the number of Kostant positive elements in , where an element is Kostant positive if Kostant's problem for the corresponding simple highest weight module in the principal block of category for has a positive answer. Almost-all-permutations conjecture. Almost all elements in are Kostant negative, in the sense that
as . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.