(k,m)-Pascal's Triangle
The paper defines a (k,m)-Pascal's triangle as weighted horizontal edges rather than the usual triangular array. For n at least m-k, the total population equals the sum of weights of edges crossing a specified vertical line. The (k,m)-Pasc…
1 sources - 4 claims
The paper defines a (k,m)-Pascal's triangle as weighted horizontal edges rather than the usual triangular array. For n at least m-k, the total population equals the sum of weights of edges crossing a specified vertical line. The (k,m)-Pascal representation compresses the binary branching tree by merging objects with the same generation and remaining lifetime. The skewed triangle connects the asymmetric branching construction to classical Pascal-triangle diagonal sums.