TOPICS
Search

Search Results for ""


4531 - 4540 of 5736 for Logistic Map R 4Search Results
There are at least two theorems known as Weierstrass's theorem. The first states that the only hypercomplex number systems with commutative multiplication and addition are ...
The weighted mean of a discrete set of numbers {x_1,x_2,...,x_n} with weights {w_1,w_2,...,w_n} is given by <x>=sum_(i=1)^nw_ix_i, (1) where each weight w_i is a nonnegative ...
Weill's theorem states that, given the incircle and circumcircle of a bicentric polygon of n sides, the centroid of the tangent points on the incircle is a fixed point W, ...
Given the incircle and circumcircle of a bicentric polygon of n sides, the centroid of the tangent points on the incircle is a fixed point W, known as the Weill point, ...
An expression is called "well-defined" (or "unambiguous") if its definition assigns it a unique interpretation or value. Otherwise, the expression is said to not be ...
A generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z] is said to be well-poised if p=q+1 and ...
The Weyl tensor is the tensor C_(abcd) defined by R_(abcd)=C_(abcd)+2/(n-2)(g_(a[c)R_d]b-g_(b[c)R_(d]a)) -2/((n-1)(n-2))Rg_(a[c)g_(d]b), (1) where R_(abcd) is the Riemann ...
(Bailey 1935, p. 25), where _7F_6(a_1,...,a_7;b_1,...,b_6) and _4F_3(a_1,...,a_4;b_1,b_2,b_3) are generalized hypergeometric functions with argument z=1 and Gamma(z) is the ...
A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...
Let B_n(r) be the n-dimensional closed ball of radius r>1 centered at the origin. A function which is defined on B(r) is called an extension to B(r) of a function f defined ...
1 ... 451|452|453|454|455|456|457 ... 574 Previous Next

...