Finite-rank crystal-graph comparison conjecture for finite unitary groups
Statement
Let be a non-negative integer, set and , and let be the induced subgraph of the reindexed Harish-Chandra branching graph on vertices of rank at most . Let be the corresponding crystal graph truncated at rank . Graph-comparison conjecture. Assume that is odd and put . Then there is an integer such that
when the colouring of the edges of the latter graph is ignored. This conjecture predicts that, up to a bound depending on , the relevant Harish-Chandra branching graph agrees with a crystal graph after reindexing. The source gives no resolution.
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.