TOPICS
Search

Search Results for ""


581 - 590 of 1004 for scalar productSearch Results
The superfactorial of n is defined by Pickover (1995) as n$=n!^(n!^(·^(·^(·^(n!)))))_()_(n!). (1) The first two values are 1 and 4, but subsequently grow so rapidly that 3$ ...
The sequence defined by e_0=2 and the quadratic recurrence equation e_n=1+product_(i=0)^(n-1)e_i=e_(n-1)^2-e_(n-1)+1. (1) This sequence arises in Euclid's proof that there ...
Let H=l^2, (alpha_n) be a bounded sequence of complex numbers, and (xi_n) be the (usual) standard orthonormal basis of H, that is, (xi_n)(m)=delta_(nm), n,m in N, where ...
Dyson (1962abc) conjectured that the constant term in the Laurent series product_(1<=i!=j<=n)(1-(x_i)/(x_j))^(a_i) (1) is the multinomial coefficient ...
A function whose range is in the complex numbers is said to be a complex function, or a complex-valued function.
A countable set is a set that is either finite or denumerable. However, some authors (e.g., Ciesielski 1997, p. 64) use the definition "equipollent to the finite ordinals," ...
Given an antisymmetric second tensor rank tensor C_(ij), a dual pseudotensor C_i is defined by C_i=1/2epsilon_(ijk)C_(jk), (1) where C_i = [C_(23); C_(31); C_(12)] (2) C_(jk) ...
The system of partial differential equations u_t = u_(xx)+u(u-a)(1-u)+w (1) w_t = epsilonu. (2)
A function f is said to have a lower bound c if c<=f(x) for all x in its domain. The greatest lower bound is called the infimum.
Given a marked point process Phi of the form Phi=(T,Y)=((T_n)_(n>=1),(Y_n)_(n>=1)), the space Y=(Y_n)_(n>=1) is said to be the mark space of Phi.
1 ... 56|57|58|59|60|61|62 ... 101 Previous Next

...