Combinatorial Wall-Crossing and the Mullineux Involution
Panagiotis Dimakis, Guangyi Yue

TL;DR
This paper introduces combinatorial wall-crossing and generalized column regularization transformations on partitions, demonstrating their effects on one-row partitions and characterizing partitions that remain regular throughout the process.
Contribution
It defines new combinatorial transformations and proves their properties, including the invariance of one-row partitions and explicit descriptions of resulting quotients.
Findings
The composition of transformations preserves the one-row partition $(n)$.
One-row partition is uniquely regular at all steps of wall-crossing.
Explicit descriptions of partition quotients in the process.
Abstract
In this paper, we define the combinatorial wall-crossing transformation and the generalized column regularization on partitions and prove that a certain composition of these two transformations has the same effect on the one-row partition . As corollaries we explicitly describe the quotients of the partitions which arise in this process. We also prove that the one-row partition is the unique partition that stays regular at any step of the wall-crossing transformation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
