Some Remarks on Combinatorial Wall-Crossing

Abstract

We establish a new simple explicit description of the Young diagram at each step of the combinatorial wall-crossing algorithm for the rational Cherednik algebra applied to the trivial representation. In this way we provide a short and explicit proof of a key theorem of P. Dimakis and G. Yue. We also present a conjecture on combinatorial wall-crossing which was found using computer experiments.