Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rational Noncrossing Partitions for all Coprime Pairs

Published 25 Jan 2017 in math.CO | (1701.07198v3)

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, \ldots, 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 $\mathfrak{S}a \times \mathbb{Z}{b-1}$ on $\mathsf{Park}{NC}(a,b)$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.