Search Results for ""

An ordered vector basisv_1,...,v_n for a finite-dimensional vector space V defines an orientation. Another basis w_i=Av_i gives the same orientation if the matrix A has a ...

Given a topological vector space X and a neighborhood V of 0 in X, the polar K=K(V) of V is defined to be the set K(V)={Lambda in X^*:|Lambdax|<=1 for every x in V} and where ...

If W is a k-dimensional subspace of a vector space V with inner product <,>, then it is possible to project vectors from V to W. The most familiar projection is when W is the ...

The vector triple product identity is also known as the BAC-CAB identity, and can be written in the form Ax(BxC) = B(A·C)-C(A·B) (1) (AxB)xC = -Cx(AxB) (2) = -A(B·C)+B(A·C). ...

The versine, also known as the "versed sine," is a little-used trigonometric function defined by versin(z) = 2sin^2(1/2z) (1) = 1-cosz, (2) where sinz is the sine and cosz is ...

A vertex-induced subgraph (sometimes simply called an "induced subgraph") is a subset of the vertices of a graph G together with any edges whose endpoints are both in this ...

The contraction of a pair of vertices v_i and v_j of a graph, also called vertex identification, is the operation that produces a graph in which the two nodes v_1 and v_2 are ...

The vertex cover number is the size of a minimum vertex cover in a graph G is known as the vertex cover number of G, denoted tau(G). The König-Egeváry theorem states that the ...

The vertex set of a graph is simply a set of all vertices of the graph. The cardinality of the vertex set for a given graph g is known as the vertex count of g. The vertex ...

A positive integer n is a veryprime iff all primes p<=sqrt(n) satisfy {|2[n (mod p)]-p|<=1 very strong; |2[n (mod p)]-p|<=sqrt(p) strong; |2[n (mod p)]-p|<=p/2 weak. (1) The ...