Search Results for ""

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

D_q=1/(1-q)lim_(epsilon->0)(lnI(q,epsilon))/(ln(1/epsilon),) (1) where I(q,epsilon)=sum_(i=1)^Nmu_i^q, (2) epsilon is the box size, and mu_i is the natural measure. The ...

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

The q-digamma function psi_q(z), also denoted psi_q^((0))(z), is defined as psi_q(z)=1/(Gamma_q(z))(partialGamma_q(z))/(partialz), (1) where Gamma_q(z) is the q-gamma ...

Define the nome by q=e^(-piK^'(k)/K(k))=e^(ipitau), (1) where K(k) is the complete elliptic integral of the first kind with modulus k, K^'(k)=K(sqrt(1-k^2)) is 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) = ...

There are two definitions of the Fermat number. The less common is a number of the form 2^n+1 obtained by setting x=1 in a Fermat polynomial, the first few of which are 3, 5, ...

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...

A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...