Search Results for ""

If u_n>0 and given B(n) a bounded function of n as n->infty, express the ratio of successive terms as |(u_n)/(u_(n+1))|=1+h/n+(B(n))/(n^r) for r>1. The series converges for ...

Gauss's theorema egregium states that the Gaussian curvature of a surface embedded in three-space may be understood intrinsically to that surface. "Residents" of the surface ...

If X is a locally compact T2-space, then the set C_ degrees(X) of all continuous complex valued functions on X vanishing at infinity (i.e., for each epsilon>0, the set {x in ...

The Gelfand transform x|->x^^ is defined as follows. If phi:B->C is linear and multiplicative in the senses phi(ax+by)=aphi(x)+bphi(y) and phi(xy)=phi(x)phi(y), where B is a ...

A algebraic loop L is a generalized Bol loop if for all elements x, y, and z of L, ((xy)z)alpha(y)=x((yz)alpha(y)) for some map alpha:L->L. As the name suggests, these are ...

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