Trinomial triangle

The trinomial triangle is a variation of Pascal's triangle. The difference between the two is that an entry in the trinomial triangle is the sum of the three (rather than the two in Pascal's triangle) entries above it:

The ${\displaystyle k}$-th entry of the ${\displaystyle n}$-th row is denoted by

${\displaystyle {n \choose k}_{2}}$.

Rows are counted starting from 0. The entries of the ${\displaystyle n}$-th row are indexed starting with ${\displaystyle -n}$ from the left, and the middle entry has index 0. The symmetry of the entries of a row about the middle entry is expressed by the relationship

${\displaystyle {n \choose k}_{2}={n \choose -k}_{2}}$

Properties[]

The ${\displaystyle n}$-th row corresponds to the coefficients in the polynomial expansion of the expansion of the trinomial ${\displaystyle (1+x+x^{2})}$ raised to the ${\displaystyle n}$-th power:^[1]

${\displaystyle \left(1+x+x^{2}\right)^{n}=\sum _{j=0}^{2n}{n \choose j-n}_{2}x^{j}=\sum _{k=-n}^{n}{n \choose k}_{2}x^{n+k}}$

or, symmetrically,

${\displaystyle \left(1+x+1/x\right)^{n}=\sum _{k=-n}^{n}{n \choose k}_{2}x^{k}}$,

hence the alternative name trinomial coefficients because of their relationship to the multinomial coefficients:

${\displaystyle {n \choose k}_{2}=\sum _{\textstyle {0\leq \mu ,\nu \leq n \atop \mu +2\nu =n+k}}{\frac {n!}{\mu !\,\nu !\,(n-\mu -\nu )!}}}$

Furthermore, the diagonals have interesting properties, such as their relationship to the triangular numbers.

The sum of the elements of ${\displaystyle n}$-th row is ${\displaystyle 3^{n}}$.

Recurrence formula[]

The trinomial coefficients can be generated using the following recurrence formula:^[1]

${\displaystyle {0 \choose 0}_{2}=1}$,

${\displaystyle {n+1 \choose k}_{2}={n \choose k-1}_{2}+{n \choose k}_{2}+{n \choose k+1}_{2}}$ for ${\displaystyle n\geq 0}$,

where ${\displaystyle {n \choose k}_{2}=0}$ for ${\displaystyle \ k<-n}$ and ${\displaystyle \ k>n}$.

Central trinomial coefficients[]

The middle entries of the trinomial triangle

1, 1, 3, 7, 19, 51, 141, 393, 1107, 3139, … (sequence A002426 in the OEIS)

were studied by Euler and are known as central trinomial coefficients.

The ${\displaystyle n}$-th central trinomial coefficient is given by

${\displaystyle {n \choose 0}_{2}=\sum _{k=0}^{n}{\frac {n(n-1)\cdots (n-2k+1)}{(k!)^{2}}}=\sum _{k=0}^{n}{n \choose 2k}{2k \choose k}.}$

Their generating function is^[2]

${\displaystyle 1+x+3x^{2}+7x^{3}+19x^{4}+\ldots ={\frac {1}{\sqrt {(1+x)(1-3x)}}}.}$

Euler noted the following exemplum memorabile inductionis fallacis ("notable example of fallacious induction"):

${\displaystyle 3{n+1 \choose 0}_{2}-{n+2 \choose 0}_{2}=F_{n}(F_{n}+1)}$ for ${\displaystyle 0\leq n\leq 7}$,

where ${\displaystyle F_{n}}$ is the n-th Fibonacci number. For larger ${\displaystyle n}$, however, this relationship is incorrect. George Andrews explained this fallacy using the general identity^[3]

${\displaystyle 2\sum _{k\in \mathbb {Z} }\left[{n+1 \choose 10k}_{2}-{n+1 \choose 10k+1}_{2}\right]=F_{n}(F_{n}+1).}$

Applications[]

In chess[]

Number of ways to reach a cell with the minimum number of moves

The triangle corresponds to the number of possible paths that can be taken by the king in a game of chess. The entry in a cell represents the number of different paths (using a minimum number of moves) the king can take to reach the cell.

In combinatorics[]

The coefficient of ${\displaystyle x^{k}}$ in the polynomial expansion of ${\displaystyle \left(1+x+x^{2}\right)^{n}}$ specifies the number of different ways of randomly drawing ${\displaystyle k}$ cards from two sets of ${\displaystyle n}$ identical playing cards.^[4] For example, in such a card game with two sets of the three cards A, B, C, the choices look like this:

In particular, this results in ${\displaystyle {24 \choose 12-24}_{2}={24 \choose -12}_{2}={24 \choose 12}_{2}}$ as the number of different hands in a game of Doppelkopf.

Alternatively, it is also possible to arrive at this number by considering the number of ways of choosing ${\displaystyle p}$ pairs of identical cards from the two sets, which is ${\displaystyle {n \choose p}}$. The remaining ${\displaystyle k-2p}$ cards can then be chosen in ${\displaystyle {n-p \choose k-2p}}$ ways,^[4] which can be written in terms of the binomial coefficients as

${\displaystyle {n \choose k-n}_{2}=\sum _{p=\max(0,k-n)}^{\min(n,[k/2])}{n \choose p}{n-p \choose k-2p}}$.

For example,

${\displaystyle 6={3 \choose 2-3}_{2}={3 \choose 0}{3 \choose 2}+{3 \choose 1}{2 \choose 0}=1\cdot 3+3\cdot 1}$.

The example above corresponds to the three ways of selecting two cards without pairs of identical cards (AB, AC, BC) and the three ways of selecting a pair of identical cards (AA, BB, CC).

References[]

Further reading[]

• Leonhard Euler (1767). "Observationes analyticae ("Analytical observations")". Novi Commentarii academiae scientiarum Petropolitanae. 11: 124–143.