Search Results for ""
731 - 740 of 3662 for Production FunctionSearch Results
The term "product" refers to the result of one or more multiplications. For example, the mathematical statement a×b=c would be read "a times b equals c," where a is called ...
Given n metric spaces X_1,X_2,...,X_n, with metrics g_1,g_2,...,g_n respectively, the product metric g_1×g_2×...×g_n is a metric on the Cartesian product X_1×X_2×...×X_n ...
A p-element x of a group G is semisimple if E(C_G(x))!=1, where E(H) is the commuting product of all components of H and C_G(x) is the centralizer of G.
The geometry of the Lie group R semidirect product with R^2, where R acts on R^2 by (t,(x,y))->(e^tx,e^(-t)y).
A bundle or fiber bundle is trivial if it is isomorphic to the cross product of the base space and a fiber.
In complex analysis, a branch (also called a sheet) is a portion of the range of a multivalued function over which the function is single-valued. Combining all the sheets ...
The Lommel polynomials R_(m,nu)(z) arise from the equation J_(m+nu)(z)=J_nu(z)R_(m,nu)(z)-J_(nu-1)(z)R_(m-1,nu+1)(z), (1) where J_nu(z) is a Bessel function of the first kind ...
The next prime function NP(n) gives the smallest prime larger than n. The function can be given explicitly as NP(n)=p_(1+pi(n)), where p_i is the ith prime and pi(n) is the ...
The previous prime function PP(n) gives the largest prime less than n. The function can be given explicitly as PP(n)=p_(pi(n-1)), where p_i is the ith prime and pi(n) is the ...
An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...
...
View search results from all Wolfram sites (415869 matches)

