Counting with Borel’s triangle

Abstract

Borel’s triangle is an array of integers closely related to the classical Catalan numbers. In this paper we study combinatorial statistics counted by Borel’s triangle. We present various combinatorial interpretations of Borel’s triangle in terms of lattice paths, binary trees, and pattern avoiding permutations and matchings, and derive a functional equation that is useful in analyzing the involved structures.