Search Results for ""

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

A figurate number Te_n of the form Te_n = sum_(k=1)^(n)T_k (1) = 1/6n(n+1)(n+2) (2) = (n+2; 3), (3) where T_k is the kth triangular number and (n; m) is a binomial ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

Discrete Mathematics

The polynomials a_n^((beta))(x) given by the Sheffer sequence with g(t) = (1-t)^(-beta) (1) f(t) = ln(1-t), (2) giving generating function ...

Let V be a vector space over a field K, and let A be a nonempty set. Now define addition p+a in A for any vector a in V and element p in A subject to the conditions: 1. ...

In the algebraic geometry of Grothendieck, a stack refers to a sheaf of categories. In particular, a stack is a presheaf of categories in which the following descent ...

The Andrews-Schur identity states sum_(k=0)^nq^(k^2+ak)[2n-k+a; k]_q =sum_(k=-infty)^inftyq^(10k^2+(4a-1)k)[2n+2a+2; n-5k]_q([10k+2a+2]_q)/([2n+2a+2]_q) (1) where [n; m]_q is ...

The word argument is used in several differing contexts in mathematics. The most common usage refers to the argument of a function, but is also commonly used to refer to the ...

The backward difference is a finite difference defined by del _p=del f_p=f_p-f_(p-1). (1) Higher order differences are obtained by repeated operations of the backward ...