TOPICS
Search

Search Results for ""


271 - 280 of 328 for Chaos gameSearch Results
Let R(z) be a rational function R(z)=(P(z))/(Q(z)), (1) where z in C^*, C^* is the Riemann sphere C union {infty}, and P and Q are polynomials without common divisors. The ...
The nth root of the denominator B_n of the nth convergent A_n/B_n of a number x tends to a constant lim_(n->infty)B_n^(1/n) = e^beta (1) = e^(pi^2/(12ln2)) (2) = 3.275823... ...
The Lyapunov characteristic exponent [LCE] gives the rate of exponential divergence from perturbed initial conditions. To examine the behavior of an orbit around a point ...
The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs, including the Herschel graph and the Goldner-Harary ...
A board is a subset of the polygons determined by a number of (usually regularly spaced and oriented) lines. These polygons form the spaces on which "pieces" can be placed ...
A doubly stochastic matrix is a matrix A=(a_(ij)) such that a_(ij)>=0 and sum_(i)a_(ij)=sum_(j)a_(ij)=1 is some field for all i and j. In other words, both the matrix itself ...
Steiner gave and Droz-Farny (1901) proved that if equal circles are drawn about the vertices of a triangle (dashed circles in the above figure), they cut the lines joining ...
An extension of two-valued logic such that statements need not be true or false, but may have a degree of truth between 0 and 1. Such a system can be extremely useful in ...
The Golay code is a perfect linear error-correcting code. There are two essentially distinct versions of the Golay code: a binary version and a ternary version. The binary ...
The multicomputational paradigm is a generalization of the computational paradigm to many computational threads of time. In the ordinary computational paradigm, time ...
1 ... 25|26|27|28|29|30|31 ... 33 Previous Next

...