Please note, due to essential maintenance online purchasing will be unavailable between 6:00 and 11:00 (GMT) on 23rd November 2019. We apologise for any inconvenience.
Named after the French–Belgian mathematician Eugène Charles Catalan, Catalan's numbers arise in various combinatorial problems . Catalan's triangle, a triangular array of numbers somewhat similar to Pascal's triangle, extends the combinatorial meaning of Catalan's numbers and generalizes them [1,5,11]. A need for a generalization of Catalan's triangle itself arose while conducting a probabilistic analysis of the Asymmetric Simple Inclusion Process (ASIP) — a model for a tandem array of queues with unlimited batch service [7–10]. In this paper, we introduce Catalan's trapezoids, a countable set of trapezoids whose first element is Catalan's triangle. An iterative scheme for the construction of these trapezoids is presented, and a closed-form formula for the calculation of their entries is derived. We further discuss the combinatorial interpretations and applications of Catalan's trapezoids.
* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.
Usage data cannot currently be displayed