Rational Noncrossing Partitions for all Coprime Pairs
Abstract
For coprime positive integers a<b, Armstrong, Rhoades, and Williams (2013) defined a set NC(a,b) of rational noncrossing partitions, a subset of the ordinary noncrossing partitions of \1, …, b-1\. Bodnar and Rhoades (2015) confirmed their conjecture that NC(a,b) is closed under rotation and proved an instance of the cyclic sieving phenomenon for this rotation action. We give a definition of NC(a,b) which works for all coprime a and b and prove closure under rotation and cyclic sieving in this more general setting. We also generalize noncrossing parking functions to all coprime a and b, and provide a character formula for the action of Sa × Zb-1 on ParkNC(a,b).
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.