Algorithmic inverse decomposition-matrix conjecture for the principal block
Statement
Let be the principal block, let and be the poset and graph subsets defined by the algorithm, and let be the grading distance. The notation denotes the graded decomposition number. Inverse decomposition-matrix conjecture. The algorithm constructs the inverse of the -decomposition matrix of :
if , and it is otherwise. This is conjectured for the standards in the minimal BGG resolution produced by the algorithm.
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.