Fuss-nonnesting orders, a rank-one obstruction, and a Boolean q-model
Statement
Problem 5.3, in free probability.
• Is there a natural generalization of the poset of nonnesting partitions N N (k)
W? In type
A, one may take k-divisible nonnesting set partitions under refinement (mimicking
N C (k)
An−1
). In the general case, perhaps this is isomorphic to a partial order on co-filtered multichains of ideals in the root order.
• Christos Athanasiadis and Stavros Garoufallidis have suggested a q-version of the Catalan combinatorics. See
Record
- Source
- Added
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.