TOPICS
Search

Search Results for ""


2051 - 2060 of 13135 for bookSearch Results
Dual pairs of linear programs are in "strong duality" if both are possible. The theorem was first conceived by John von Neumann. The first written proof was an Air Force ...
The Dürer graph is the skeleton of Dürer's solid, which is the generalized Petersen graph GP(6,2). It is illustrated above in a number of embeddings. It is implemented in the ...
The dumbbell curve is the sextic curve a^4y^2=x^4(a^2-x^2). (1) It has area A=1/4pia^2 (2) and approximate arc length s approx 5.541a. (3) For the parametrization x = at (4) ...
A pair of conics obtained by expanding an equation in Monge's form z=F(x,y) in a Maclaurin series z = z(0,0)+z_1x+z_2y+1/2(z_(11)x^2+2z_(12)xy+z_(22)y^2)+... (1) = ...
In three mutually orthogonal systems of surfaces, the lines of curvature on any surface in one of the systems are its intersections with the surfaces of the other two systems.
Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_n=f(x_n). Then Durand's rule approximating the ...
Let F(n) be a family of partitions of n and let F(n,d) denote the set of partitions in F(n) with Durfee square of size d. The Durfee polynomial of F(n) is then defined as the ...
The length of the largest-sized square contained within the Ferrers diagram of a partition. Its size can be determined using DurfeeSquare[f] in the Wolfram Language package ...
The Dutch windmill graph D_3^((m)), also called a friendship graph, is the graph obtained by taking m copies of the cycle graph C_3 with a vertex in common (Gallian 2007), ...
Dyads extend vectors to provide an alternative description to second tensor rank tensors. A dyad D(A,B) of a pair of vectors A and B is defined by D(A,B)=AB. The dot product ...
1 ... 203|204|205|206|207|208|209 ... 1314 Previous Next

...