The conjecture that separable permutations are exactly the bijective Weyl-group actions on KL bases
Statement
Let be a simply-laced Weyl group with Dynkin diagram , and let be a based -representation arising from categorification. In the symmetric-group case, let be the irreducible representation indexed by a partition , let be its Kazhdan–Lusztig basis, and let denote the subgroup or class of separable permutations. Choose with . Separable-permutation conjecture. The element acts on by a bijection up to lower-order terms if and only if . This would give, in a precise sense, the best possible solution to the question of which permutations act on Kazhdan–Lusztig bases by bijections up to lower-order terms; the theorem establishing this for separable permutations is complemented by examples showing that non-separable permutations need not have this property. The exact scope of the converse and its formulation across the relevant representations remain to be verified from the paper.
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.