Search Results for ""

A generalized hypergeometric function _pF_q(a_1,...,a_p;b_1,...,b_q;x) is a function which can be defined in the form of a hypergeometric series, i.e., a series for which the ...

The G-transform of a function f(x) is defined by the integral (Gf)(x)=(G_(pq)^(mn)|(a_p); (b_q)|f(t))(x) (1) =1/(2pii)int_sigmaGamma[(b_m)+s, 1-(a_n)-s; (a_p^(n+1))+s, ...

If there are two functions F_1(t) and F_2(t) with the same integral transform T[F_1(t)]=T[F_2(t)]=f(s), (1) then a null function can be defined by delta_0(t)=F_1(t)-F_2(t) ...

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...

The E_n(x) function is defined by the integral E_n(x)=int_1^infty(e^(-xt)dt)/(t^n) (1) and is given by the Wolfram Language function ExpIntegralE[n, x]. Defining t=eta^(-1) ...

The Hilbert transform (and its inverse) are the integral transform g(y) = H[f(x)]=1/piPVint_(-infty)^infty(f(x)dx)/(x-y) (1) f(x) = ...

A rigorous mathematical argument which unequivocally demonstrates the truth of a given proposition. A mathematical statement that has been proven is called a theorem. ...

The game of billiards is played on a rectangular table (known as a billiard table) upon which balls are placed. One ball (the "cue ball") is then struck with the end of a ...

A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with n graph vertices is denoted K_n and has (n; 2)=n(n-1)/2 (the ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...