Bezrukavnikov's transpose symmetry conjecture for wall-crossing algorithms
Statement
Let be a positive integer, let be a partition of , and let be an interval whose endpoints are consecutive entries in the Farey sequence of . Write for the transpose partition of , and let and denote the quantities defined by the paper's two wall-crossing algorithms.
Bezrukavnikov's conjecture. For every partition of and every such interval , one has
This conjecture asserts a transpose symmetry between the two combinatorial wall-crossing algorithms and relates their outputs through partition conjugation. Its resolution is not specified in the supplied source material.
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.