Search Results for ""

A q-series is series involving coefficients of the form (a;q)_n = product_(k=0)^(n-1)(1-aq^k) (1) = product_(k=0)^(infty)((1-aq^k))/((1-aq^(k+n))) (2) = ...

There are a great many beautiful identities involving q-series, some of which follow directly by taking the q-analog of standard combinatorial identities, e.g., the ...

There are several q-analogs of the sine function. The two natural definitions of the q-sine defined by Koekoek and Swarttouw (1998) are given by sin_q(z) = ...

_2phi_1(a,q^(-n);c;q,q)=(a^n(c/a,q)_n)/((a;q)_n), where _2phi_1(a,b;c;q,z) is a q-hypergeometric function.

_8phi_7[a,qa^(1/2),-qa^(1/2),b,c,d,e,q^(-N); a^(1/2),-a^(1/2),(aq)/b,(aq)/c,(aq)/d,(aq)/e,aq^(N+1);q,(aq^(N+2))/(bcde)] ...

A q-analog of Zeilberger's algorithm.

A generalization of an Ulam sequence in which each term is the sum of two earlier terms in exactly s ways. (s,t)-additive sequences are a further generalization in which each ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p). An s-cluster is an isolated group of s adjacent (i.e., horizontally ...

An s-route of a graph G is a sequence of vertices (v_0,v_1,...,v_s) of G such that v_iv_(i+1) in E(G) for i=0, 1, ..., s-1 (where E(G) is the edge set of G) and ...

Let v be a n-vector whose entries are each 1 (with probability p) or 0 (with probability q=1-p). An s-run is an isolated group of s consecutive 1s. Ignoring the boundaries, ...