Search Results for ""

Let A, B, and C be three polar vectors, and define V_(ijk) = |A_i B_i C_i; A_j B_j C_j; A_k B_k C_k| (1) = det[A B C], (2) where det is the determinant. The V_(ijk) is a ...

Given an antisymmetric second tensor rank tensor C_(ij), a dual pseudotensor C_i is defined by C_i=1/2epsilon_(ijk)C_(jk), (1) where C_i = [C_(23); C_(31); C_(12)] (2) C_(jk) ...

A term in social choice theory meaning each alternative receives equal weight for a single vote.

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) = ...

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), ...