Paperlane

no. 16 · Tuesday 17 November 2026

Centralizers in Catalan Monoids

Janusz Konieczny and Emrah Korkmaz

math.GR · 36 pp

Abstract

Fix a chain $X_n=\{1<\cdots<n\}$, where $n$ is a positive integer. The Catalan monoid $\mathcal{C}_n$ consists of all decreasing and order-preserving transformations of $X_n$, with function composition as the operation. For $β\in\mathcal{C}_n$, its centralizer is $C(β)=\{α\in\mathcal{C}_n:αβ=βα\}$. We characterize the elements of $C(\varepsilon)$, $C(μ)$, and $C(β)$, where $\varepsilon\in\mathcal{C}_n$ is an idempotent, $μ\in\mathcal{C}_n$ is a nilpotent, and $β\in\mathcal{C}_n$ is a general element. For an idempotent $\varepsilon\in\mathcal{C}_n$, we derive formulas for the cardinality of $C(\varepsilon)$, as well as formulas for the numbers of idempotents and nilpotents of $C(\varepsilon)$. We relate indexing sets arising in these formulas to Dyck paths and Narayana numbers. For a nilpotent $μ\in\mathcal{C}_n$, we present algorithms that construct $C(μ)$, its subset of idempotents, and its subsemigroup of nilpotents, thereby determining their cardinalities. We also describe the nilpotents whose centralizers consist only of idempotents, of nilpotents together with the identity, or of nilpotents and idempotents. We extend these descriptions to arbitrary elements of $\mathcal{C}_n$. To obtain our results, we represent $β\in\mathcal{C}_n$ as a sequence $\langle T_1,\ldots,T_m\rangle$ of rooted trees. The sets of vertices of the trees form a partition of $X_n$. Each tree is level-ordered, which means that it can be drawn in such a way that moving from the root down, level by level, from left to right at each level, we pass through an increasing sequence of consecutive elements of $X_n$.

comments
36 pages
fields
Group Theory, Combinatorics
pdf ↗ page arXiv:2611.21071 ↗