Search Results for ""
5051 - 5060 of 9127 for Logistic Map R 2Search Results
The term "biquadratic equation" is sometimes used to as a synonym for quartic equation (Beyer 1987b, p. 34), but perhaps more commonly (e.g., Hazewinkel 1988; Gellert et al. ...
A bitangent is a line that is tangent to a curve at two distinct points. Aa general plane quartic curve has 28 bitangents in the complex projective plane. However, as shown ...
A CW-complex is a homotopy-theoretic generalization of the notion of a simplicial complex. A CW-complex is any space X which can be built by starting off with a discrete ...
Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 or m=2,3, but only a small ...
The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted ...
A cyclide is a pair of focal conics which are the envelopes of two one-parameter families of spheres, sometimes also called a cyclid. The cyclide is a quartic surface, and ...
A (p,q)-graph is edge-graceful if the edges can be labeled 1 through q in such a way that the labels induced on the vertices by summing over incident edges modulo p are ...
The elliptic logarithm is generalization of integrals of the form int_infty^x(dt)/(sqrt(t^2+at)), for a real, which can be expressed in terms of logarithmic and inverse ...
The Fischer groups are the three sporadic groups Fi_(22), Fi_(23), and Fi_(24)^'. These groups were discovered during the investigation of 3-transposition groups. The Fischer ...
The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...
...
View search results from all Wolfram sites (557507 matches)

