The conjecture on the possible numbers of one-element commutation classes
Statement
Let and let . Let denote the set of one-element commutation classes of reduced words of . The possible-cardinalities conjecture. For all ,
Theorem 7.1 gives the upper bound , while computation through found no example with exactly three one-element commutation classes. The conjecture asserts that three never occurs; the source does not report a proof or disproof.
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.