Search Results for ""
2671 - 2680 of 5736 for Logistic Map R 4Search Results
An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.
A surface parameterized in variables u and v is called smooth if the tangent vectors in the u and v directions satisfy T_uxT_v!=0, where AxB is a cross product.
A perimeter-bisecting line segment which originates at a vertex of a polygon. The three splitters of a triangle concur in a point known as the Nagel point Na.
A transformation characterized by an invariant line and a scale factor (one-way stretch) or two invariant lines and corresponding scale factors (two-way stretch).
There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...
Trials for which the Lexis ratio L=sigma/(sigma_B), satisfies L>1, where sigma is the variance in a set of s Lexis trials and sigma_B is the variance assuming Bernoulli ...
Given a sequence of real numbers a_n, the supremum limit (also called the limit superior or upper limit), written lim sup and pronounced 'lim-soup,' is the limit of ...
A tournament sequence is an increasing sequence of positive integers (t_1, t_2, ...) such that t_1=1 and t_(i+1)<=2t_i. Cook and Kleber (2000) show that Meeussen sequences ...
An element of an extension field of a field F which is not algebraic over F. A transcendental number is a complex number which is transcendental over the field Q of rational ...
A sphere of radius 1.
...
View search results from all Wolfram sites (464545 matches)

