TOPICS
Search

Search Results for ""


3341 - 3350 of 13134 for binomial theorySearch Results
A line segment connecting nonadjacent polyhedron vertices sharing a common face in a parallelepiped or other similar solid.
The Farey sequence F_n for any positive integer n is the set of irreducible rational numbers a/b with 0<=a<=b<=n and (a,b)=1 arranged in increasing order. The first few are ...
Let A be a matrix and x and b vectors. Then the system Ax=b, x>=0 has no solution iff the system A^(T)y>=0, b^(T)y<0 has a solution, where y is a vector (Fang and Puthenpura ...
A finite geometry is a geometry with a finite number of points. When confined to a plane, all finite geometries are either projective plane geometries (with no parallel ...
Frequency representation is the notation (1^(a_1)2^(a_2)...) used to abbreviate a partition {1,...,1_()_(a_1),2,...,2_()_(a_2),...} (Andrews 1998, p. 1).
Let t be an infinite word over a finite alphabet Sigma. Then there exists a uniformly recurrent infinite word r such that Sub(r) subset= Sub(t), where Sub(w) is the set of ...
The computer animation format MPEG-7 uses Gabor functions to specify texture descriptors.
V_t=e^(-ytau)S_tN(d_1)-e^(-rtau)KN(d_2), where N is the cumulative normal distribution and d_1,d_2=(log((S_t)/K)+(r-y+/-1/2sigma^2)tau)/(sigmasqrt(tau)). If y=0, this is the ...
For even h, (1) (Nagell 1951, p. 176). Writing out symbolically, sum_(n=0)^h((-1)^nproduct_(k=0)^(n-1)(1-x^(h-k)))/(product_(k=1)^(n)(1-x^k))=product_(k=0)^(h/2-1)1-x^(2k+1), ...
The Gelfand-Naimark theorem states that each C^*-algebra is isometrically *-isomorphic to a closed *-subalgebra of the algebra B(H) consisting of all bounded operators acting ...
1 ... 332|333|334|335|336|337|338 ... 1314 Previous Next

...