TOPICS
Search

Search Results for ""


951 - 960 of 1392 for linear programmingSearch Results
The image on the Riemann sphere of any circle under a complex rational mapping with numerator and denominator having degrees no more than n has length no longer than 2npi.
The Stolarsky mean of two numbers a and c is defined by S_p(a,c)=[(a^p-c^p)/(p(a-c))]^(1/(p-1)) (Havil 2003, p. 121).
A map T:(M_1,omega_1)->(M_2,omega_2) between the symplectic manifolds (M_1,omega_1) and (M_2,omega_2) which is a diffeomorphism and T^*(omega_2)=omega_1, where T^* is the ...
A symplectic form on a smooth manifold M is a smooth closed 2-form omega on M which is nondegenerate such that at every point m, the alternating bilinear form omega_m on the ...
The third power point is the triangle center with triangle center function alpha_(32)=a^3. It is Kimberling center X_(32).
Every real number is negative, 0, or positive. The law is sometimes stated as "For arbitrary real numbers a and b, exactly one of the relations a<b, a=b, a>b holds" (Apostol ...
A projection of a link is tricolorable if each of the strands in the projection can be colored in one of three different colors such that, at each crossing, all three colors ...
A graph in which individual nodes have no distinct identifications except through their interconnectivity. Graphs in which labels (which are most commonly numbers) are ...
The span of subspace generated by vectors v_1 and v_2 in V is Span(v_1,v_2)={rv_1+sv_2:r,s in R}. A set of vectors m={v_1,...,v_n} can be tested to see if they span ...
Every nonempty set of positive integers contains a smallest member.
1 ... 93|94|95|96|97|98|99 ... 140 Previous Next

...