We provide a new algorithm for indefinite nested summation which is applicable to summands involving unspecified sequences x(n). More than that, we show how to extend Karr's ...
The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions ...
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Ta...
This paper shows that the number of sign patterns of totally non-zero symmetric n-by-n matrices, up to conjugation by monomial matrices and negation, is equal to the number of unl...
By a very simple argument, we prove that if l, m, n {0, 1, 2, . . . } then l k=0 (-1)m-k l k m - k n 2k k - 2l + m = l k=0 l k 2k n n - l m + n - 3k - l . On the basis of this ide...