Noncrossing partitions under rotation and reflection
Combinatorics
2007-05-23 v3
Abstract
We consider noncrossing partitions of [n] under the action of (i) the reflection group (of order 2), (ii) the rotation group (cyclic of order n) and (iii) the rotation/reflection group (dihedral of order 2n). First, we exhibit a bijection from rotation classes to bicolored plane trees on n edges, and consider its implications. Then we count noncrossing partitions of [n] invariant under reflection and show that, somewhat surprisingly, they are equinumerous with rotation classes invariant under reflection. The proof uses a pretty involution originating in work of Germain Kreweras. We conjecture that the "equinumerous" result also holds for arbitrary partitions of [n].
Cite
@article{arxiv.math/0510447,
title = {Noncrossing partitions under rotation and reflection},
author = {David Callan and Len Smiley},
journal= {arXiv preprint arXiv:math/0510447},
year = {2007}
}
Comments
15 pages, LaTeX, PSTricks, .eps figures