---
title: Kreweras Complement in Noncrossing Partitions
url: https://www.emergentmind.com/topics/kreweras-complement
type: topic
---

# Kreweras Complement in Noncrossing Partitions

The Kreweras complement is a fundamental involutive transformation on the lattice of noncrossing partitions, with deep connections to Coxeter group theory, Fuss–Catalan combinatorics, free probability, promotion operators, and cyclic sieving phenomena. It admits both a geometric presentation—filling complementary regions in partition diagrams—and algebraic formulations, notably as an anti-automorphism interleaving the positions of elements in multipartite structures. The concept generalizes to higher-order and Coxeter-theoretic settings, playing a central structural role in combinatorics and its applications.

## 1. Classical Definition and Properties

Let $[n]=\{1,2,\ldots,n\}$ and consider $\operatorname{NCP}(n)$, the poset of noncrossing partitions of $[n]$ (ordered by refinement). The Kreweras complement $K$ is the unique map $K: \operatorname{NCP}(n) \rightarrow \operatorname{NCP}(n)$ with the following geometric realization: place the points $1, 2, \ldots, n$ around a circle and draw the convex hulls for each block in a given partition $\pi$. Then insert primed points $1',2',\ldots, n'$ in the gaps between consecutive integers. The Kreweras complement $K(\pi)$ is the coarsest noncrossing partition on the primed points such that the union of the diagrams for $\pi$ and $K(\pi)$ yields a maximal noncrossing partition on the $2n$-gon. This construction is unique and bijective [2211.10958, 2303.12240, 2407.17660].

Table: Classical Kreweras Complement (Key Properties)

| Property              | Statement                                                                                         | Reference    |
|-----------------------|---------------------------------------------------------------------------------------------------|--------------|
| Anti-automorphism     | $\pi\leq\sigma\implies K(\sigma)\leq K(\pi)$                                                      | [2211.10958] |
| Rank-reversal         | $\text{rank}(\pi)+\text{rank}(K(\pi))=n+1$                                                        | [2211.10958] |
| Cyclicity             | $K^2(\pi)$ is $\pi$ rotated by $1$ (mod $n$); $K^{n}$ is identity up to block rotation            | [2211.10958] |
| Self-complementarity  | Fixed points are symmetric partitions, counted by $C_{\lfloor n/2\rfloor}$                        | [2211.10958] |
| Lattice involution    | $K$ is a bijection, and $K^2$ acts as a cyclic rotation of the circle                             | [2211.10958] |

These properties make $K$ a lattice anti-automorphism and induce a dihedral action on $\operatorname{NCP}(n)$ by pairing with the Simion–Ullman involution [2211.10958, 2303.12240].

## 2. Coxeter-Theoretic and Algebraic Formulation

The Kreweras complement extends to the setting of finite Coxeter groups $W$, particularly via the absolute order on $W$ with respect to reflections $T$, and a choice of Coxeter element $c$. The noncrossing partitions relative to $c$ are
\[
\operatorname{NC}(W,c) = \{ w\in W: 1\leq_T w\leq_T c \},
\]
where $\leq_T$ denotes the absolute order. The Kreweras complement becomes
\[
\Krew(w) = c w^{-1},
\]
with periodicity $\Krew^2(w) = c w c^{-1}$, and hence $\Krew^{2h} = \mathrm{id}$ where $h$ is the Coxeter number [1101.1277, 2212.14831]. In type $A_{n-1}$ this recovers the geometric description above, both via permutation and combinatorial polygonal models.

Algebraically, for noncrossing partitions $\pi\in NC_n$, $K$ can be realized as the unique solution to
\[
\pi\circ_n K(\pi) = \mathbf{1}_n,
\]
using a partial monoid structure $\circ_n$, based on “perfect shuffle” operations and join in the lattice of noncrossing partitions [2407.17660].

## 3. Cyclic Sieving, Enumerative Invariants, and Orbit Structure

The Kreweras complement generates a cyclic group action on $\operatorname{NCP}(n)$, and its orbit structure is highly constrained:
- $K$-orbits have lengths that divide $2n$, related to the automorphism group of the underlying partition or associated plane tree [2303.12240].
- The number of noncrossing partitions invariant under $K^r$ is determined by closed-form binomial or $q$-Catalan formulas, such as the (positive) Fuss–Catalan polynomials
\[
\operatorname{Cat}_+^{(m)}(W;q) = \prod_{i=1}^n \frac{[mh + d_i - 2]_q}{[d_i]_q}
\]
where $\{d_i\}$ are the degrees of $W$ [2506.14996].

This underpinning gives rise to striking cyclic sieving phenomena—evaluation of the $q$-Catalan polynomial at suitable roots of unity counts partitions fixed by a given power of $K$ [2303.12240, 2506.14996, 1101.1277]. Fixed points correspond to symmetric noncrossing partitions, with the number given by Catalan numbers for even $n$ [2211.10958].

## 4. Generalizations: Higher-Order and Coxeter-Theoretic Complements

Extensions of the Kreweras complement arise in various ways:
- **m-divisible Noncrossing Partitions:** In type $A_{n-1}$, $m$-divisible noncrossing partitions are in bijection with tuples of elements in $W$ whose product is a Coxeter element, with block sizes divisible by $m$. Krattenthaler–Stump’s positive Kreweras maps generalize $K$, realized as pseudo-rotations, and order parameters depend on $m$, $n$, and the Coxeter type [2506.14996].
- **Higher-Order Complements:** For each $p\geq2$, one considers $p$-fold operations and $p$-preserving partitions. The $p$-completing Kreweras complement $\Sigma$ solves $\pi_1\circ_n\cdots\circ_n\pi_p\circ_n\Sigma = \mathbf{1}_n$ [2407.17660].
  
In these settings, the cyclic order, enumeration of fixed partitions, and cyclic sieving phenomena admit explicit closed-form descriptions.

## 5. Connections with Promotion, Rowmotion, and Lattice Theory

Recent developments have revealed that the Kreweras complement is closely related to classical and “toggle” actions in poset combinatorics:
- **Promotion Operator:** In rational and classical Catalan combinatorics, the Kreweras complement acts as Schützenberger’s promotion operator on Dyck paths and $k$-chains of noncrossing partitions, with $K^2$ corresponding to rotation and higher powers to evacuation [2603.17402].
- **Noncrossing–Nonnesting Bijections:** The complement intertwines with the Panyushev map on nonnesting partitions. For type $A$, the Kreweras complement on noncrossing partitions corresponds to the Kroweras complement on nonnesting partitions under a unique support-preserving, equivariant bijection distinguished by Coxeter combinatorics and the “charmed roots” statistic [1101.1277, 2212.14831].
- **Partial Monoid and Incidence Coalgebras:** The partial associative product and incidence coalgebra structure for noncrossing partitions are preserved under Kreweras complementation, leading to deep analogies with the arithmetic of the divisibility poset and multiplicative monoids [2407.17660].

## 6. Representation in Other Structures and Applications

- **Plane Trees and Biological Models:** The Kreweras complement corresponds to a cyclic rerooting operation on plane trees, manifesting as a shift of the root vertex. These structures model certain RNA folding patterns, and $K$-orbits classify fold topologies under cyclic permutation [2303.12240].
- **Noncommutative Extensions:** The lattice of noncommutative crossing partitions contains the Kreweras lattice as a sublattice; the Kreweras complement extends naturally as an endomorphism in this richer category, retaining anti-automorphism properties [2211.10958].
- **Free Probability:** Higher-order complements, partial monoid operations, and the Möbius inversion structures underlying $K$ are essential in the algebraic underpinning of relations between moments and cumulants in free probability [2407.17660].

## 7. Explicit Computation, Algorithms, and Examples

The Kreweras complement admits efficient algorithmic realization:
- Geometrically, by tracing regions in the circle or finding maximal noncrossing matchings for the complementary set of points.
- Via the partial monoid product, by determining admissible pairs and constructing the complement as the unique partition that “fills out” to the maximal element [2407.17660].
- In the context of Dyck paths and $k$-chains, by explicit implementation of promotion operators and bijection algorithms [2603.17402].

Small-$n$ examples (e.g., for $n=3$ or $4$) demonstrate the involutive and cyclic properties, as well as the enumeration of orbits and self-complementary partitions [2211.10958, 2407.17660, 2303.12240].

---

**References**

- [2506.14996]: Positive $m$-divisible non-crossing partitions and their Kreweras maps
- [1101.1277]: A uniform bijection between nonnesting and noncrossing partitions
- [2212.14831]: Charmed roots and the Kroweras complement
- [2211.10958]: Noncommutative crossing partitions
- [2603.17402]: Promotion and rowmotion in rational Catalan combinatorics
- [2407.17660]: Noncrossing arithmetics
- [2303.12240]: Counting orbits under Kreweras complementation

Source: https://www.emergentmind.com/topics/kreweras-complement