1 problem

Let $n\geq 2$. Let $\operatorname{RG}_\mathrm{nc}(n)$ denote the set of noncrossing restricted-growth words of length $n$, and let $\operatorname{RG}_\mathrm{nc}(n,k)$ denote those…