Combinatorial Wall-Crossing and the Mullineux Involution

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 (n). 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…