Some remarks on combinatorial wall-crossing
Combinatorics
2021-06-09 v2
Abstract
We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two conjectures on combinatorial wall-crossing which were found using computer experiments.
Cite
@article{arxiv.1809.07206,
title = {Some remarks on combinatorial wall-crossing},
author = {Galyna Dobrovolska},
journal= {arXiv preprint arXiv:1809.07206},
year = {2021}
}