Bergeron's combinatorial supersymmetry conjecture
Statement
Let be the multigraded -module with commuting and anticommuting variable sets, let be its character, and let
be the stable character for commuting variables. Let be an infinite alphabet of anticommuting tracking variables and a Littlewood–Richardson coefficient. Bergeron's combinatorial supersymmetry conjecture. For any , is obtained from
by setting for and for . The conjecture predicts that all mixed commuting–anticommuting characters are determined by the stable commuting character. The source gives no resolution status.
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.