Raney and Catalan Original Research Article

Raney’s lemma is often used in a counting argument to prove the formula for (generalized) Catalan numbers. It ensures the existence of “good” cyclic shifts of certain sequences, i.e. cyclic shifts for which all partial sums are positive. We introduce a simple algorithm that finds these cyclic shifts and also those with a slightly weaker property. Moreover it provides simple proofs of lemma’s of Raney type. A similar clustering procedure is also used in a simple proof of a theorem on probabilities of which many well-known results (e.g. on lattice paths and on generalized Catalan numbers) can be derived as corollaries. The theorem generalizes generalized Catalan numbers. In the end it turns out to be equivalent to a formula of Raney.