Search Results for ""

The generalized diameter is the greatest distance between any two points on the boundary of a closed figure. The diameter of a subset E of a Euclidean space R^n is therefore ...

A generalized eigenvector for an n×n matrix A is a vector v for which (A-lambdaI)^kv=0 for some positive integer k in Z^+. Here, I denotes the n×n identity matrix. The ...

The surface generated by a twisted curve C when rotated about a fixed axis A and, at the same time, displaced parallel to A so that the velocity of displacement is always ...

The generalized hypergeometric function F(x)=_pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;x] satisfies the equation where theta=x(partial/partialx) is the ...

Given a linear code C, a generator matrix G of C is a matrix whose rows generate all the elements of C, i.e., if G=(g_1 g_2 ... g_k)^(T), then every codeword w of C can be ...

A d-dimensional framework is a pair (G,p) where G=(V,E) is a graph with vertex set V and edge set E and p:V->R^d is a map that assigns a point in R^d to each vertex of G. The ...

Given a planar graph G, its geometric dual G^* is constructed by placing a vertex in each region of G (including the exterior region) and, if two regions have an edge x in ...

The Georges graph, illustrated above, is 50-node graph which is the smallest currently known example of a 3-connected bicubic nonhamiltonian graph. It is implemented in the ...

The internal (external) bisecting plane of a dihedral angle of a tetrahedron divides the opposite edge in the ratio of the areas of the adjacent faces.

If the sampling of an interferogram is modulated at a definite frequency instead of being uniformly sampled, spurious spectral features called "ghosts" are produced (Brault ...