Web-basis conjecture for flamingo Specht modules
Statement
Let and let denote the collection of set partitions that can be made noncrossing by applying at most adjacent transpositions. For each set partition , order its blocks in any way to obtain a corresponding ordered set partition . Web-basis conjecture. The set
is linearly independent. The claim extends the preceding linear-independence theorem: for , the relevant set consists of the noncrossing partitions and the result is already known, while the conjecture has been verified computationally for some higher values of .
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.