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

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

Analytic continuation gives an equivalence relation between function elements, and the equivalence classes induced by this relation are called global analytic functions.

The gnomonic projection is a nonconformal map projection obtained by projecting points P_1 (or P_2) on the surface of sphere from a sphere's center O to point P in a plane ...

The Goddard-Henning enneahedron, a term coined here, is the canonical polyhedron obtained from the Goddard-Henning graph. It has 9 vertices, 16 edges (consisting of 3 ...

Nice approximations for the golden ratio phi are given by phi approx sqrt((5pi)/6) (1) approx (7pi)/(5e), (2) the last of which is due to W. van Doorn (pers. comm., Jul. 18, ...

If A is a graded module and there exists a degree-preserving linear map phi:A tensor A->A, then (A,phi) is called a graded algebra. Cohomology is a graded algebra. In ...

The term "gradient" has several meanings in mathematics. The simplest is as a synonym for slope. The more general gradient, called simply "the" gradient in vector analysis, ...

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...

The eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...