Search Results for ""

Let [arg(f(z))] denote the change in the complex argument of a function f(z) around a contour gamma. Also let N denote the number of roots of f(z) in gamma and P denote the ...

For a second-order ordinary differential equation, y^('')+p(x)y^'+q(x)y=g(x). (1) Assume that linearly independent solutions y_1(x) and y_2(x) are known to the homogeneous ...

Let a vault consist of two equal half-cylinders of radius r which intersect at right angles so that the lines of their intersections (the "groins") terminate in the ...

Consider three squares erected externally on the sides of a triangle DeltaABC. Call the centers of these squares O_A, O_B, and O_C, respectively. Then the lines AO_A, BO_B, ...

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

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

A convex polyhedron is defined as the set of solutions to a system of linear inequalities mx<=b (i.e., a matrix inequality), where m is a real s×d matrix and b is a real ...