Search Results for ""

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.

The constants lambda_(m,n)=inf_(r in R_(m,n))sup_(x>=0)|e^(-x)-r(x)|, where r(x)=(p(x))/(q(x)), p and q are mth and nth order polynomials, and R_(m,n) is the set of all ...

Every "large" even number may be written as 2n=p+m where p is a prime and m in P union P_2 is the set of primes P and semiprimes P_2.

Given a set P of primes, a field K is called a class field if it is a maximal normal extension of the rationals which splits all of the primes in P, and if P is the maximal ...

Let V be a vector space over a field K, and let A be a nonempty set. For an appropriately defined affine space A, K is called the coefficient field.

A compact surface is a surface which is also a compact set. A compact surface has a triangulation with a finite number of triangles. The sphere and torus are compact.

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

The cotangent bundle of a manifold is similar to the tangent bundle, except that it is the set (x,f) where x in M and f is a dual vector in the tangent space to x in M. The ...

For a countable set of n disjoint events E_1, E_2, ..., E_n P( union _(i=1)^nE_i)=sum_(i=1)^nP(E_i).

A three-dimensional data set consisting of stacked two-dimensional data slices as a function of a third coordinate.