TOPICS
Search

Search Results for ""


1111 - 1120 of 1395 for order costSearch Results
L_nu(z) = (1/2z)^(nu+1)sum_(k=0)^(infty)((1/2z)^(2k))/(Gamma(k+3/2)Gamma(k+nu+3/2)) (1) = (2(1/2z)^nu)/(sqrt(pi)Gamma(nu+1/2))int_0^(pi/2)sinh(zcostheta)sin^(2nu)thetadtheta, ...
The moment of inertia with respect to a given axis of a solid body with density rho(r) is defined by the volume integral I=intrho(r)r__|_^2dV, (1) where r__|_ is the ...
A monomial is a product of positive integer powers of a fixed set of variables (possibly) together with a coefficient, e.g., x, 3xy^2, or -2x^2y^3z. A monomial can also be ...
Noncommutative topology is a recent program having important and deep applications in several branches of mathematics and mathematical physics. Because every commutative ...
A nut graph is a graph on n>=2 vertices with adjacency matrix A such that A has matrix rank 1 and contains no 0 element (Sciriha 1998, 2008; Sciriha and Gutman, 1998; and ...
The octahedral equation, by way of analogy with the icosahedral equation, is a set of related equations derived from the projective geometry of the octahedron. Consider an ...
Partial derivatives are defined as derivatives of a function of multiple variables when all but the variable of interest are held fixed during the differentiation. (1) The ...
A space-filling function which maps a one-dimensional interval into a two-dimensional area. Plane-filling functions were thought to be impossible until Hilbert discovered the ...
A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...
Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...
1 ... 109|110|111|112|113|114|115 ... 140 Previous Next

...