Search Results for ""

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

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

The set of all edge automorphisms of G, denoted Aut^*(G). Let L(G) be the line graph of a graph G. Then the edge automorphism group Aut^*(G) is isomorphic to Aut(L(G)), ...

The edge multiplicity of a given end vertex in a multigraph is the number of multiple edges sharing that end vertex. The maximum edge multiplicity in such a graph is known as ...

Let (X,B,mu) be a measure space and let E be a measurable set with mu(E)<infty. Let {f_n} be a sequence of measurable functions on E such that each f_n is finite almost ...

One of the operations of addition, subtraction, multiplication, division, and integer (or rational) root extraction.

E(a,b)/p denotes the elliptic group modulo p whose elements are 1 and infty together with the pairs of integers (x,y) with 0<=x,y<p satisfying y^2=x^3+ax+b (mod p) (1) with a ...

The second-order ordinary differential equation (x^2y^')^'+x^2y^n=0.

Two nonsuperimposable objects which are mirror images of each other are called enantiomers. The term enantiomer is synonymous with enantiomorph. For example, the letters b ...

Given a module M over a unit ring R, the set End_R(M) of its module endomorphisms is a ring with respect to the addition of maps, (f+g)(x)=f(x)+g(x), for all x in M, and the ...