= Bijective Proof Problems by Richard P. Stanley
{c}
{tag=Work by Richard P. Stanley}
{title2=dated 2009}
By <Richard P. Stanley>.
Online text: https://math.mit.edu/~rstan/bij.pdf
Authored problem collection. The inspected cover is dated 18 August 2009; this identifies the supplied version rather than a book publication date. The Catalan interpretations occur in §5, printed pp. 38–39, Problems 153–159.
Cited passages: §5, Problem 154, printed p. 38: binary parenthesizations of n+1 letters; §5, printed pp. 38–39, formula (7) and Problems 154–159: Catalan counts, binary parenthesizations, binary trees and Dyck paths.
Back to article page
