Search Results for ""

The vertex set of a graph is simply a set of all vertices of the graph. The cardinality of the vertex set for a given graph g is known as the vertex count of g. The vertex ...

A W^*-algebra is a C-*-algebra A for which there is a Banach space A_* such that its dual is A. Then the space A_* is uniquely defined and is called the pre-dual of A. Every ...

where _3F_2(a,b,c;d,e;z) is a generalized hypergeometric function and Gamma(z) is the gamma function (Bailey 1935, p. 16; Koepf 1998, p. 32).

A transform which localizes a function both in space and scaling and has some desirable properties compared to the Fourier transform. The transform is based on a wavelet ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), .... Then Weddle's rule approximating the integral of ...

A statistic w on the symmetric group S_n is called a weighted inversion statistic if there exists an upper triangular matrix W=(w_(ij)) such that ...

Weill's theorem states that, given the incircle and circumcircle of a bicentric polygon of n sides, the centroid of the tangent points on the incircle is a fixed point W, ...

A continuous-time stochastic process W(t) for t>=0 with W(0)=0 and such that the increment W(t)-W(s) is Gaussian with mean 0 and variance t-s for any 0<=s<t, and increments ...

A variant of the Pollard p-1 method which uses Lucas sequences to achieve rapid factorization if some factor p of N has a decomposition of p+1 in small prime factors.

The (m,n)-windmill graph is the graph obtained by taking m copies of the complete graph K_n with a vertex in common (Gallian 2011, p. 16). The (m,n)-windmill graph is ...