Search Results for ""
1031 - 1040 of 1395 for order costSearch Results

A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...
The equation of motion for a membrane shaped as a right isosceles triangle of length c on a side and with the sides oriented along the positive x and y axes is given by where ...
There are at least two distinct notions known as the Whitehead group. Given an associative ring A with unit, the Whitehead group associated to A is the commutative quotient ...
A function that can be defined as a Dirichlet series, i.e., is computed as an infinite sum of powers, F(n)=sum_(k=1)^infty[f(k)]^n, where f(k) can be interpreted as the set ...
A zonal harmonic is a spherical harmonic of the form P_l(costheta), i.e., one which reduces to a Legendre polynomial (Whittaker and Watson 1990, p. 302). These harmonics are ...
Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...
The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...
Replacing the logistic equation (dx)/(dt)=rx(1-x) (1) with the quadratic recurrence equation x_(n+1)=rx_n(1-x_n), (2) where r (sometimes also denoted mu) is a positive ...
In most modern literature, a Boolean model is a probabilistic model of continuum percolation theory characterized by the existence of a stationary point process X and a ...
The convex hull of a set of points S in n dimensions is the intersection of all convex sets containing S. For N points p_1, ..., p_N, the convex hull C is then given by the ...

...