Catalan Numbers and Permutations

Abstract

Summary The Catalan numbers are the solution to hundreds of interesting counting problems. We consider a set of permutations counted not by the Catalan numbers, but by the squares of the Catalan numbers. While their enumeration is already known by more technical methods, we present a new proof by giving a bijection with pairs of arrangements of parentheses.