scientific article; zbMATH DE number 2145141
\textit{B. A. Bondarenko} [Generalized Pascal triangles and pyramids, their fractals, graphs and applications (Russian) (Tashkent: Fan) (1990; Zbl 0706.05002) (translated into English by R. C. Bollinger (Santa Clara, CA: The Fibonacci Association)) (1993; Zbl 0792.05001)] gives an excellent account of the history and properties of the binomial coefficients of order \(s\) (the entries in the Pascal triangle of order \(s\)). These coefficients, usually denoted by \({n\choose m}_s\) for \(n\geq 0\), \(m\geq 0\) and \(s\geq 2\) \((C_2(n, m))\) count the number of different ways \(m\) objects can be placed in \(n\) cells, each of which holds a maximum of \(s-1\) objects. The ordinary binomial coefficients are obtained for \(s = 2\). The above description tacitly assumes that empty cells produce distinct arrangements, the objects are placed in the cells in a given order, and the order of the objects within the cells is not important. The authors extend a number of identities for the binomial coefficients of order \(s\), by considering whether (a) empty cells give new arrangements, (b) the order of objects across the cells is free, and (c) the order of objects within the cells gives new arrangements. For the entire collection see [Zbl 1054.11005].
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657473)