TOPICS
Search

Search Results for ""


51 - 60 of 293 for loaded diceSearch Results
A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...
A chord which is a normal at each end. A centrosymmetric set K subset R^d has d double normals through the center (Croft et al. 1991). For a curve of constant width, all ...
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 ...
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 ...
If L^~ is a linear operator on a function space, then f is an eigenfunction for L^~ and lambda is the associated eigenvalue whenever L^~f=lambdaf. Renteln and Dundes (2005) ...
The elongated gyrobifastigium, which could also be called an elongated digonal gyrobicupola, is a family of octahedra obtained by elongating the gyrobifastigium with four ...
The Elsasser function is defined by the integral E(y,u)=int_(-1/2)^(1/2)exp[-(2piyusinh(2piy))/(cosh(2piy)-cos(2pix))]dx. (1) Special values include E(0,u) = 1 (2) E(y,0) = ...
The second-order ordinary differential equation (x^2y^')^'+x^2y^n=0.
A morphism f:Y->X in a category is an epimorphism if, for any two morphisms u,v:X->Z, uf=vf implies u=v. In the categories of sets, groups, modules, etc., an epimorphism is ...
1 ... 3|4|5|6|7|8|9 ... 30 Previous Next

...