TOPICS
Search

Search Results for ""


611 - 620 of 633 for Logistic MapSearch Results
There are four varieties of Airy functions: Ai(z), Bi(z), Gi(z), and Hi(z). Of these, Ai(z) and Bi(z) are by far the most common, with Gi(z) and Hi(z) being encountered much ...
The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...
The function frac(x) giving the fractional (noninteger) part of a real number x. The symbol {x} is sometimes used instead of frac(x) (Graham et al. 1994, p. 70; Havil 2003, ...
The class of all regular sequences of particularly well-behaved functions equivalent to a given regular sequence. A distribution is sometimes also called a "generalized ...
The Kaprekar routine is an algorithm discovered in 1949 by D. R. Kaprekar for 4-digit numbers, but which can be generalized to k-digit numbers. To apply the Kaprekar routine ...
A manifold is a topological space that is locally Euclidean (i.e., around every point, there is a neighborhood that is topologically the same as the open unit ball in R^n). ...
A projective plane, sometimes called a twisted sphere (Henle 1994, p. 110), is a surface without boundary derived from a usual plane by addition of a line at infinity. Just ...
The regular heptagon is the seven-sided regular polygon illustrated above, which has Schläfli symbol {7}. According to Bankoff and Garfunkel (1973), "since the earliest days ...
A set is a finite or infinite collection of objects in which order has no significance, and multiplicity is generally also ignored (unlike a list or multiset). Members of a ...
The Soifer graph, illustrated above in a number of embeddings, is a planar graph on 9 nodes that tangles the Kempe chains in Kempe's algorithm and thus provides an example of ...
1 ... 59|60|61|62|63|64 Previous Next

...