Search Results for ""

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

The canonical bundle is a holomorphic line bundle on a complex manifold which is determined by its complex structure. On a coordinate chart (z_1,...z_n), it is spanned by the ...

Classical algebraic geometry is the study of algebraic varieties, both affine varieties in C^n and projective algebraic varieties in CP^n. The original motivation was to ...

An abbreviation for the cokernel.

A tensor-like coefficient which gives the difference between partial derivatives of two coordinates with respect to the other coordinate, ...

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.

A function f(x) is completely convex in an open interval (a,b) if it has derivatives of all orders there and if (-1)^kf^((2k))(x)>=0 for k=0, 1, 2, ... in that interval ...

Contracting tensors lambda with nu in the Bianchi identities R_(lambdamunukappa;eta)+R_(lambdamuetanu;kappa)+R_(lambdamukappaeta;nu)=0 (1) gives ...

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

The covercosine, also called the coversed cosine, is a little-used trigonometric function defined by covercos(z) = vercos(1/2pi-z) (1) = 1+sinz, (2) where vercosz is the ...