Polygon dissections and standard Young tableaux (Q1924248)

A simple bijection is given between dissections of a convex \((n+2)\)-gon by \(d\) non-crossing diagonals and standard Young tableaux of shape \((d+1,d+1,1^{n-1-d})\). In the case \(d=n-1\), these sets are enumerated by the Catalan numbers, and for \(0\leq d< n\) the hook length formula gives the number of tableaux as \({n+d+2\choose d+1}{n-1\choose d}/(n+d+2)\). The construction exploits a bijection, found by \textit{I. M. H. Etherington} [J. Lond. Math. Soc. 15, 136-149 (1940; Zbl 0027.15502)], between the first set and sequences with non-negative partial sums consisting of \(d+1\) positive integers with sum \(n\) and \(n\)-1's. The reviewer notes that, in the recursive definition of this bijection, the sequence associated with a `dissected polygon' consisting of a single edge should be the empty sequence, rather than the sequence \((-1)\).