Search Results for ""

Given a sequence {a_k}_(k=1)^n, a partial sum of the first N terms is given by S_N=sum_(k=1)^Na_k.

Let A be a finite-dimensional power-associative algebra, then A is the vector space direct sum A=A_(11)+A_(10)+A_(01)+A_(00), where A_(ij), with i,j=0,1 is the subspace of A ...

A vertex of a graph is said to be pendant if its neighborhood contains exactly one vertex.

A perfect field is a field F such that every algebraic extension is separable. Any field in field characteristic zero, such as the rationals or the p-adics, or any finite ...

The portion of a surface left when an open disk is removed from it.

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

The line joining the three collinear points of intersection of the extensions of corresponding sides in perspective triangles, also called the perspectrix or homology axis.

The 4-polyhex illustrated above.

The symbol +/- is used to denote a quantity which should be both added and subtracted, as in a+/-b. The symbol can be used to denote a range of uncertainty, or to denote a ...

An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...