Learn More

The inversion of combinatorial sums is a fundamental problem in algebraic combinatorics. Some combinatorial sums, such as a n = P k d n;k b k , can not be inverted in terms of the orthogonality relation because the innnite, lower triangular array P = fd n;k g's diagonal elements are equal to zero (except d 0;0). Despite this, we can nd a left-inverse P such… (More)

- ‹
- 1
- ›