Search Results for ""

A special case of Stokes' theorem in which F is a vector field and M is an oriented, compact embedded 2-manifold with boundary in R^3, and a generalization of Green's theorem ...

The point on the positive ray of the normal vector at a distance rho(s), where rho is the radius of curvature. It is given by z = x+rhoN (1) = x+rho^2(dT)/(ds), (2) where N ...

A curve whose centrode revolves about a fixed axis with constant angle and speed when the curve is traversed with unit speed. The tangent indicatrix of a curve of constant ...

A coordinate system composed of intersecting surfaces. If the intersections are all at right angles, then the curvilinear coordinates are said to form an orthogonal ...

A cusp catastrophe is a catastrophe which can occur for two control factors and one behavior axis. The cusp catastrophe is the universal unfolding of the singularity f(x)=x^4 ...

A cusp form is a modular form for which the coefficient c(0)=0 in the Fourier series f(tau)=sum_(n=0)^inftyc(n)e^(2piintau) (1) (Apostol 1997, p. 114). The only entire cusp ...

Given a weighted, undirected graph G=(V,E) and a graphical partition of V into two sets A and B, the cut of G with respect to A and B is defined as cut(A,B)=sum_(i in A,j in ...

The cut elimination theorem, also called the "Hauptsatz" (Gentzen 1969), states that every sequent calculus derivation can be transformed into another derivation with the ...

A chord of a graph cycle C is an edge not in the edge set of C whose endpoints lie in the vertex set C (West 2000, p. 225). For example, in the diamond graph as labeled ...

The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...