In mathematics and computing, a triangular array of numbers, polynomials, or the like, is a doubly indexed sequence in which each row is only as long as the row's own index.
Notable particular examples include these:
Triangular arrays of integers in which each row is symmetric and begins and ends with 1 are sometimes called generalized Pascal triangles; examples include Pascal's triangle, the Narayana numbers, and the triangle of Eulerian numbers.
Arrays in which the length of each row grows as a linear function of the row number (rather than being equal to the row number) have also been considered.
Apart from the representation of triangular matrices, triangular arrays are used in several algorithms. One example is the CYK algorithm for parsing context-free grammars, an example of dynamic programming.
Manage research, learning and skills at NCR Works. Create an account using LinkedIn to manage and organize your omni-channel knowledge. NCR Works is like a shopping cart for information -- helping you to save, discuss and share.