Search Results for ""

q-calculus or quantum calculus is a methodology comparable to the usual study of calculus but which is centered on the idea of deriving q-analogous results without the use of ...

A q-analog of the Chu-Vandermonde identity given by where _2phi_1(a,b;c;q,z) is the q-hypergeometric function. The identity can also be written as ...

Given a real number q>1, the series x=sum_(n=0)^inftya_nq^(-n) is called the q-expansion, or beta-expansion (Parry 1957), of the positive real number x if, for all n>=0, ...

A q-analog of the gamma function defined by Gamma_q(x)=((q;q)_infty)/((q^x;q)_infty)(1-q)^(1-x), (1) where (x,q)_infty is a q-Pochhammer symbol (Koepf 1998, p. 26; Koekoek ...

A q-analog of Gauss's theorem due to Jacobi and Heine, _2phi_1(a,b;c;q,c/(ab))=((c/a;q)_infty(c/b;q)_infty)/((c;q)_infty(c/(ab);q)_infty) (1) for |c/(ab)|<1 (Gordon and ...

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 ...

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, ...

A number of interesting graphs are associated with the work of van Cleemput and Zamfirescu (2018). Two 13- and 15-node graphs, denoted alpha and beta respectively, were used ...